cp's OEIS Frontend

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.

A233766 Digital root of Lucas numbers (A030133) indexed by natural numbers not divisible by 2, 3 or 5 (A007775).

Original entry on oeis.org

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, 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, 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
Offset: 1

Views

Author

Gary Croft, Dec 15 2013

Keywords

Comments

32-beat repeating sequence.

Crossrefs

Formula

Conjectures from Colin Barker, Sep 22 2019: (Start)
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)).
a(n) = a(n-24) for n>24.
(End)