This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A049341 #31 Jul 11 2024 23:06:46
%S A049341 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 A049341 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 A049341 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 A049341 a(n+1) = sum of digits of a(n) + a(n-1).
%C A049341 a(n+1) = A007953(a(n) + a(n-1)) for n > 0.
%H A049341 Reinhard Zumkeller, <a href="/A049341/b049341.txt">Table of n, a(n) for n = 0..10000</a>
%H A049341 Michael Gilleland, <a href="/selfsimilar.html">Some Self-Similar Integer Sequences</a>
%H A049341 <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 A049341 Period 8.
%e A049341 After 6,9 we get 6+9 = 15 -> 1+5 = 6.
%t A049341 LinearRecurrence[{0, 0, 0, 0, 0, 0, 0, 1},{3, 6, 9, 6, 6, 3, 9, 3},112] (* _Ray Chandler_, Aug 27 2015 *)
%o A049341 (Haskell)
%o A049341 a049341 n = a030132_list !! n
%o A049341 a049341_list =
%o A049341 3 : 6 : map a007953 (zipWith (+) a049341_list $ tail a049341_list)
%o A049341 -- _Reinhard Zumkeller_, Aug 20 2011
%Y A049341 Cf. A030132, A030133, A049342.
%K A049341 base,nonn,easy
%O A049341 0,1
%A A049341 _Damir Olejar_
%E A049341 Definition improved by _Reinhard Zumkeller_, Aug 20 2011