OFFSET
0,7
COMMENTS
The cyclic pattern (and numerator of the g.f.) 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
Vincenzo Librandi, Table of n, a(n) for n = 0..10000
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,0,1,-1).
FORMULA
G.f.: x^3*(1+x^3+x^5) / ( (1+x)*(x^2+1)*(x^4+1)*(x-1)^2 ).
From Wesley Ivan Hurt, May 15 2015: (Start)
a(n) = a(n-1)+a(n-8)-a(n-9).
Sum_{n>=3} (-1)^(n+1)/a(n) = Pi/(6*sqrt(3)) + log(3)/2. - Amiram Eldar, Sep 30 2022
MAPLE
MATHEMATICA
Floor[3 Range[0, 100]/8] (* Wesley Ivan Hurt, May 15 2015 *)
PROG
(Magma) [Floor(3*n/8): n in [0..80]]; // Vincenzo Librandi, Jul 07 2011
(PARI) a(n)=3*n>>3 \\ Charles R Greathouse IV, Jul 07 2011
CROSSREFS
KEYWORD
nonn,easy
AUTHOR
EXTENSIONS
Numerator of g.f. corrected by R. J. Mathar, Feb 20 2011
STATUS
approved