The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
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 (list; graph; refs; listen; history; text; internal format)
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.?
LINKS
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

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified June 11 08:36 EDT 2024. Contains 373293 sequences. (Running on oeis4.)