|
Search: id:A027434
|
|
|
| A027434 |
|
a(1) = 2; then defined by property that a(n) = smallest number > a(n-1) such that successive runs have lengths 1,1,2,2,3,3,4,4. |
|
+0
3
|
|
| 2, 3, 4, 4, 5, 5, 6, 6, 6, 7, 7, 7, 8, 8, 8, 8, 9, 9, 9, 9, 10, 10, 10, 10, 10, 11, 11, 11, 11, 11, 12, 12, 12, 12, 12, 12, 13, 13, 13, 13, 13, 13, 14, 14, 14, 14, 14, 14, 14, 15, 15, 15, 15, 15, 15, 15, 16, 16, 16, 16, 16, 16, 16, 16, 17, 17, 17, 17, 17, 17, 17, 17, 18, 18, 18, 18
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
COMMENT
|
a(n) = A027709(n)/2. - Tanya Khovanova (tanyakh(AT)yahoo.com), Mar 04 2008
|
|
REFERENCES
|
Sam Speed, An integer sequence (preprint).
|
|
FORMULA
|
a(n) = 1+[ sqrt(4n-3) ].
|
|
CROSSREFS
|
A027434(n)=A049068(n)-n.
Sequence in context: A130233 A131234 A056791 this_sequence A071940 A085883 A094192
Adjacent sequences: A027431 A027432 A027433 this_sequence A027435 A027436 A027437
|
|
KEYWORD
|
nonn,nice,easy
|
|
AUTHOR
|
Sam Speed (SPEEDS(AT)msci.memphis.edu)
|
|
EXTENSIONS
|
More terms from Courtney Clipp (cclipp(AT)ashland.edu), Dec 08 2004
|
|
|
Search completed in 0.002 seconds
|
