Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A053436
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
%I A053436
%S A053436 2,3,5,6,10,11,18,19,30,31,47,48,70,71,100,101,138,139,185,186,242,243,
%T A053436 310,311,390,391,483,484,590,591,712,713,850,851,1005,1006,1178,1179,
%U A053436 1370,1371,1582,1583,1815,1816,2070,2071,2348,2349,2650,2651
%N A053436 a(n)=n+1 + ceil(n/2)*(ceil(n/2)-1)*(ceil(n/2)+1)/6.
%D A053436 G. Giani, K. Strassburger, Multiple comparison procedures for optimally 
               discriminating between good, equivalent and bad treatments with respect 
               to a control, J. Statist. Planning Infer. 83 (No. 2, 2000), 413-440
%H A053436 J. Statist. Planning Infer., <a href="http://www.elsevier.nl/inca/publications/
               store/5/0/5/5/6/1/">Journal home page</a>
%Y A053436 a(n)=n+1+A000292(ceil(n/2)-2)
%Y A053436 Sequence in context: A130689 A024560 A000039 this_sequence A057546 A138587 
               A099350
%Y A053436 Adjacent sequences: A053433 A053434 A053435 this_sequence A053437 A053438 
               A053439
%K A053436 easy,nonn
%O A053436 1,1
%A A053436 Klaus Strassburger (strass(AT)ddfi.uni-duesseldorf.de), Jan 11 2000

    
page 1

Search completed in 0.001 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified November 25 20:09 EST 2009. Contains 167514 sequences.


AT&T Labs Research