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 A230113 #14 Sep 22 2019 12:19:44
%S A230113 3,4,5,6,6,5,4,3,4,6,6,5,4,3,3,5,6,5,4,3,3,4,5,6,5,3,3,4,5,6,6,4,3,4,
%T A230113 5,6,6,5,4,3,4,6,6,5,4,3,3,5,6,5,4,3,3,4,5,6,5,3,3,4,5,6,6,4,3,4,5,6,
%U A230113 6,5,4,3,4,6,6,5,4,3,3,5,6,5,4,3,3,4,5,6,5,3,3,4,5,6,6,4
%N A230113 Digital root of summed Fibonacci and Lucas digital roots indexed by numbers not divisible by 2, 3 or 5.
%C A230113 32-beat repeating sequence is periodically palindromic starting at Length(40), then at Lengths (72)...(104)...(136)...(168)...{+32 terms ... repeat ... n}.
%F A230113 Conjectures from _Colin Barker_, Sep 22 2019: (Start)
%F A230113 G.f.: x*(3 + x + x^2 + x^3 - x^5 - x^6 - x^7 + x^8 + 2*x^9 - x^11 - x^12 - x^13 + 2*x^15 + 4*x^16) / ((1 - x)*(1 + x^16)).
%F A230113 a(n) = a(n-1) - a(n-16) + a(n-17) for n>17.
%F A230113 (End)
%e A230113 Referencing A227896 (Fibo) and A233766 (Lucas): 1st Fibo term (1) + 1st Lucas term (2) = 3 = digital root 3. Likewise, 2nd Fibo term (4) + 2nd Lucas term (9) = 13 = digital root 4.
%Y A230113 Cf. A007775, A227896, A233766, A000032, A000033.
%K A230113 nonn,base,less
%O A230113 1,1
%A A230113 _Gary Croft_, Dec 20 2013