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 A233766 #12 Sep 22 2019 20:47:55 %S A233766 2,9,6,7,2,9,3,7,9,7,2,9,3,2,7,6,7,9,3,2,7,9,6,2,2,9,6,7,2,9,3,7,9,7, %T A233766 2,9,3,2,7,6,7,9,3,2,7,9,6,2,2,9,6,7,2,9,3,7,9,7,2,9,3,2,7,6,7,9,3,2, %U A233766 7,9,6,2,2,9,6,7,2,9,3,7,9,7,2,9,3,2,7,6,7,9,3,2,7,9,6,2 %N A233766 Digital root of Lucas numbers (A030133) indexed by natural numbers not divisible by 2, 3 or 5 (A007775). %C A233766 32-beat repeating sequence. %F A233766 Conjectures from _Colin Barker_, Sep 22 2019: (Start) %F A233766 G.f.: x*(2 + 9*x + 6*x^2 + 7*x^3 + 2*x^4 + 9*x^5 + 3*x^6 + 7*x^7 + 9*x^8 + 7*x^9 + 2*x^10 + 9*x^11 + 3*x^12 + 2*x^13 + 7*x^14 + 6*x^15 + 7*x^16 + 9*x^17 + 3*x^18 + 2*x^19 + 7*x^20 + 9*x^21 + 6*x^22 + 2*x^23) / ((1 - x)*(1 + x)*(1 - x + x^2)*(1 + x^2)*(1 + x + x^2)*(1 - x^2 + x^4)*(1 + x^4)*(1 - x^4 + x^8)). %F A233766 a(n) = a(n-24) for n>24. %F A233766 (End) %Y A233766 Cf. A000032, A007775, A030133. %K A233766 nonn,base,less %O A233766 1,1 %A A233766 _Gary Croft_, Dec 15 2013