This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A010068 a(n+1) = a(n) + sum of digits in base 6 representation of a(n). 1
 1, 2, 4, 8, 11, 17, 24, 28, 36, 37, 39, 43, 46, 52, 59, 68, 76, 82, 89, 98, 106, 117, 124, 133, 141, 152, 159, 168, 176, 187, 194, 203, 216, 217, 219, 223, 226, 232, 239, 248, 256, 262, 269, 278, 286, 297, 304, 313, 321, 332, 339, 348, 356, 367 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,2 COMMENTS a(n) mod 5 repeats 1,2,4,3. - Robert Israel, Aug 04 2019 REFERENCES S. R. Finch, Mathematical Constants, Cambridge, 2003, Section 2.24. LINKS Robert Israel, Table of n, a(n) for n = 0..10000 MAPLE f:= n -> n + convert(convert(n, base, 6), `+`): A[0]:= 1: for n from 1 to 100 do A[n]:= f(A[n-1]) od: seq(A[i], i=0..100); # Robert Israel, Aug 04 2019 CROSSREFS Sequence in context: A153195 A279097 A279098 * A295674 A120632 A007295 Adjacent sequences:  A010065 A010066 A010067 * A010069 A010070 A010071 KEYWORD nonn,base AUTHOR EXTENSIONS More terms from Neven Juric, Apr 11 2008 STATUS approved

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

Last modified September 20 01:52 EDT 2019. Contains 327207 sequences. (Running on oeis4.)