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”).

A134548
a(1)=1, a(n) = 2 + maximal digit of Sum_{j=1..n-1} a(j).
1
1, 3, 6, 3, 5, 10, 10, 10, 10, 10, 10, 10, 10, 11, 11, 4, 6, 5, 7, 6, 10, 10, 10, 10, 10, 11, 11, 4, 6, 5, 7, 6, 10, 10, 10, 10, 10, 11, 11, 5, 7, 5, 9, 8, 7, 8, 11, 10, 11, 6, 9, 8, 6, 6, 8, 6, 7, 9, 8, 9, 10, 11, 7, 7, 10, 10, 10, 10, 10, 10, 10, 10, 11, 11, 8, 10, 10, 10, 10, 10, 10, 10
OFFSET
1,2
COMMENTS
For n > 1, 3 <= a(n) <= 11 by definition. Also subsequences with repeating terms may be arbitrarily long. What about any other patterns, periods, etc.?
MATHEMATICA
a[1]=i=s=1; Do[i++; b=2+Max[IntegerDigits[s]]; a[i]=b; s+=b, {145}]; Table[a[k], {k, i}]
CROSSREFS
Sequence in context: A340704 A199951 A351101 * A151865 A124860 A182412
KEYWORD
base,nonn
AUTHOR
Zak Seidov, Oct 31 2007
STATUS
approved