login
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
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.
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: A354884 A279097 A279098 * A295674 A120632 A007295
KEYWORD
nonn,base
EXTENSIONS
More terms from Neven Juric, Apr 11 2008
STATUS
approved