A117339 a(n) = a(n-1) + a(n-2); if a(n) is not prime divide a(n) by its largest prime factor.
1, 1, 2, 3, 5, 4, 3, 7, 2, 3, 5, 4, 3, 7, 2, 3, 5, 4, 3, 7, 2, 3, 5, 4, 3, 7, 2, 3, 5, 4, 3, 7, 2, 3, 5, 4, 3, 7, 2, 3, 5, 4, 3, 7, 2, 3, 5, 4, 3, 7, 2, 3, 5, 4, 3, 7, 2, 3, 5, 4, 3, 7, 2, 3, 5, 4, 3, 7, 2, 3, 5, 4, 3, 7, 2, 3, 5, 4, 3, 7, 2, 3, 5, 4, 3, 7, 2, 3, 5, 4, 3, 7, 2, 3, 5, 4, 3, 7, 2, 3, 5, 4, 3, 7, 2
Offset: 1
Links
- Index entries for linear recurrences with constant coefficients, signature (0,0,0,0,0,1).
Crossrefs
Cf. A214674.
Formula
G.f.: -(6*x^8+2*x^7+4*x^6+5*x^5+3*x^4+2*x^3+x^2+x)/(x^6-1). - Alois P. Heinz, Apr 20 2023
Comments