login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A088496
Length of n-th run = n-th partial sum.
1
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
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. (E.g., third run has length 5 since s(3)=5.)
CROSSREFS
Cf. A000002.
Sequence in context: A025454 A327104 A126061 * A036602 A176166 A167911
KEYWORD
nonn
AUTHOR
Benoit Cloitre, Nov 10 2003
STATUS
approved