%I #28 Feb 19 2024 01:56:29
%S 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,
%T 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,
%U 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
%N a(n+1) = sum of digits of a(n) + a(n-1).
%C a(n+1) = a007953(a(n) + a(n-1)) for n > 0.
%H Reinhard Zumkeller, <a href="/A049341/b049341.txt">Table of n, a(n) for n = 0..10000</a>
%H Michael Gilleland, <a href="/selfsimilar.html">Some Self-Similar Integer Sequences</a>
%H <a href="/index/Rec#order_08">Index entries for linear recurrences with constant coefficients</a>, signature (0, 0, 0, 0, 0, 0, 0, 1).
%F Period 8.
%e After 6,9 we get 6+9 = 15 -> 1+5 = 6.
%t LinearRecurrence[{0, 0, 0, 0, 0, 0, 0, 1},{3, 6, 9, 6, 6, 3, 9, 3},112] (* _Ray Chandler_, Aug 27 2015 *)
%o (Haskell)
%o a049341 n = a030132_list !! n
%o a049341_list =
%o 3 : 6 : map a007953 (zipWith (+) a049341_list $ tail a049341_list)
%o -- _Reinhard Zumkeller_, Aug 20 2011
%Y Cf. A030132, A030133, A049342.
%K base,nonn
%O 0,1
%A _Damir Olejar_
%E Definition improved by _Reinhard Zumkeller_, Aug 20 2011
|