login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A053436 a(n)=n+1 + ceil(n/2)*(ceil(n/2)-1)*(ceil(n/2)+1)/6. 0
2, 3, 5, 6, 10, 11, 18, 19, 30, 31, 47, 48, 70, 71, 100, 101, 138, 139, 185, 186, 242, 243, 310, 311, 390, 391, 483, 484, 590, 591, 712, 713, 850, 851, 1005, 1006, 1178, 1179, 1370, 1371, 1582, 1583, 1815, 1816, 2070, 2071, 2348, 2349, 2650, 2651 (list; graph; refs; listen; history; internal format)
OFFSET

1,1

REFERENCES

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

LINKS

J. Statist. Planning Infer., Journal home page

CROSSREFS

a(n)=n+1+A000292(ceil(n/2)-2)

Sequence in context: A130689 A024560 A000039 * A057546 A138587 A099350

Adjacent sequences:  A053433 A053434 A053435 * A053437 A053438 A053439

KEYWORD

easy,nonn

AUTHOR

Klaus Strassburger (strass(AT)ddfi.uni-duesseldorf.de), Jan 11 2000

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 16 14:37 EST 2012. Contains 205930 sequences.