OFFSET
0,4
COMMENTS
The cyclic pattern (and numerator of the gf) is computed using Euclid's algorithm for GCD.
REFERENCES
N. Dershowitz and E. M. Reingold, Calendrical Calculations, Cambridge University Press, 1997.
R. L. Graham, D. E. Knuth and O. Patashnik, Concrete Mathematics, Addison-Wesley, NY, 1994.
LINKS
G. C. Greubel, Table of n, a(n) for n = 0..5000
N. Dershowitz and E. M. Reingold, Calendrical Calculations Web Site.
Index entries for linear recurrences with constant coefficients, signature (1,0,0,0,0,0,1,-1).
FORMULA
G.f. x^2*(1+x+x^3+x^4+x^5) / ( (x^6+x^5+x^4+x^3+x^2+x+1)*(x-1)^2 ). Numerator corrected Feb 20 2011
Sum_{n>=2} (-1)^n/a(n) = sqrt(10-2*sqrt(5))*Pi/10 + log(phi)/sqrt(5) - log(2)/5, where phi is the golden ratio (A001622). - Amiram Eldar, Sep 30 2022
MATHEMATICA
Floor[5 Range[0, 75]/7] (* Harvey P. Dale, Mar 18 2011 *)
PROG
(PARI) a(n)=5*n\7 \\ Charles R Greathouse IV, Sep 02 2015
(Magma) [Floor(5*n/7): n in [0..50]]; // G. C. Greubel, Nov 02 2017
CROSSREFS
KEYWORD
nonn,easy
AUTHOR
STATUS
approved