OFFSET
0,5
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,0,0,0,0,0,0,0,0,0, 0,0,0,0,0,1,-1).
FORMULA
a(n) = a(n-1) + a(n-21) - a(n-22).
G.f.: x^2*(1 + x^2 + x^3 + x^5 + x^7 + x^8 + x^10 + x^11 + x^13 + x^15 + x^16 + x^18 + x^19)/( (1+x+x^2)*(x^6 + x^5 + x^4 + x^3 + x^2 + x + 1)*(x^12 - x^11 + x^9 - x^8 + x^6 - x^4 + x^3 - x + 1)*(x-1)^2 ). [Numerator corrected Feb 20 2011]
MATHEMATICA
Table[Floor[13*n/21], {n, 0, 50}] (* G. C. Greubel, Nov 02 2017 *)
PROG
(PARI) 13*n\21 \\ Charles R Greathouse IV, Sep 02 2015
(Magma) [Floor(12*n/21): n in [0..50]]; // G. C. Greubel, Nov 02 2017
CROSSREFS
KEYWORD
nonn,easy
AUTHOR
STATUS
approved