|
|
A049341
|
|
a(n+1) = sum of digits of a(n) + a(n-1).
|
|
4
|
|
|
3, 6, 9, 6, 6, 3, 9, 3, 3, 6, 9, 6, 6, 3, 9, 3, 3, 6, 9, 6, 6, 3, 9, 3, 3, 6, 9, 6, 6, 3, 9, 3, 3, 6, 9, 6, 6, 3, 9, 3, 3, 6, 9, 6, 6, 3, 9, 3, 3, 6, 9, 6, 6, 3, 9, 3, 3, 6, 9, 6, 6, 3, 9, 3, 3, 6, 9, 6, 6, 3, 9, 3, 3, 6, 9, 6, 6, 3, 9, 3, 3, 6, 9, 6, 6, 3, 9, 3, 3, 6, 9, 6, 6, 3, 9, 3, 3, 6, 9, 6, 6, 3, 9, 3, 3, 6, 9, 6, 6, 3, 9, 3
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
0,1
|
|
COMMENTS
|
a(n+1) = A007953(a(n) + a(n-1)) for n > 0.
|
|
LINKS
|
|
|
FORMULA
|
Period 8.
|
|
EXAMPLE
|
After 6,9 we get 6+9 = 15 -> 1+5 = 6.
|
|
MATHEMATICA
|
LinearRecurrence[{0, 0, 0, 0, 0, 0, 0, 1}, {3, 6, 9, 6, 6, 3, 9, 3}, 112] (* Ray Chandler, Aug 27 2015 *)
|
|
PROG
|
(Haskell)
a049341 n = a030132_list !! n
a049341_list =
3 : 6 : map a007953 (zipWith (+) a049341_list $ tail a049341_list)
|
|
CROSSREFS
|
|
|
KEYWORD
|
base,nonn,easy
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|