|
Search: id:A088496
|
|
|
| A088496 |
|
Length of n-th run = n-th partial sum. |
|
+0
2
|
|
| 1, 2, 2, 2, 1, 1, 1, 1, 1, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 2, 2, 2, 2, 2, 2, 2
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
FORMULA
|
sum(k=1, n, a(k))=3/2*n+o(n)
|
|
EXAMPLE
|
partial sums s(n)=sum(k=1,n,a(k)) are : 1,3,5,7,... hence sequence begins 1,2,2,2,1,1,1,1,1,2,2,2,2,2,2,2,1. (ex : third run has length 5 since s(3)=5)
|
|
CROSSREFS
|
Cf. A000002.
Adjacent sequences: A088493 A088494 A088495 this_sequence A088497 A088498 A088499
Sequence in context: A128522 A025454 A126061 this_sequence A036602 A037804 A081503
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Benoit Cloitre (benoit7848c(AT)orange.fr), Nov 10 2003
|
|
|
Search completed in 0.002 seconds
|
