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

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
OFFSET
0,1
COMMENTS
a(n+1) = A007953(a(n) + a(n-1)) for n > 0.
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)
-- Reinhard Zumkeller, Aug 20 2011
CROSSREFS
KEYWORD
base,nonn,easy
AUTHOR
EXTENSIONS
Definition improved by Reinhard Zumkeller, Aug 20 2011
STATUS
approved