|
| |
| |
|
|
|
0, 0, 0, 1, 1, 2, 2, 3, 3, 3, 4, 4, 5, 5, 6, 6, 6, 7, 7, 8, 8, 9, 9, 9, 10, 10, 11, 11, 12, 12, 12, 13, 13, 14, 14, 15, 15, 15, 16, 16, 17, 17, 18, 18, 18, 19, 19, 20, 20, 21, 21, 21, 22, 22, 23, 23, 24, 24, 24, 25, 25, 26, 26, 27, 27, 27, 28, 28, 29, 29, 30, 30, 30, 31, 31, 32, 32
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 0,6
|
|
|
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
| N. Dershowitz and E. M. Reingold, Calendrical Calculations Web Site
Index to sequences with linear recurrences with constant coefficients, signature (1,0,0,0,0,0,1,-1)
|
|
|
FORMULA
| G.f.: (1+x^2+x^4)*x^3/((1-x)*(1-x^7)) - Bruce Corrigan (scentman(AT)myfamily.com), Jul 03 2002
for all m>=0 a(7m)=0 mod 3; a(7m+1)=0 mod 3; a(7m+2)= 0 mod 3; a(7m+3) = 1 mod 3; a(5m+4) = 1 mod 3; a(7m+5) = 2 mod 3; a(7m+6) = 2 mod 3 - Bruce Corrigan (scentman(AT)myfamily.com), Jul 03 2002
a(n)=-1+Sum{k=0..n}{(1/49)*(-6*(k mod 7)+8*((k+1) mod 7)-6*((k+2) mod 7)+8*((k+3) mod 7)-6*((k+4) mod 7)+((k+5) mod 7)+8*((k+6) mod 7)} [From Paolo P. Lava (paoloplava(AT)gmail.com), Nov 17 2008]
|
|
|
CROSSREFS
| Floors of other ratios: A004526, A002264, A002265, A004523, A057353, A057354, A057355, A057356, A057357, A057358, A057359, A057360, A057361, A057362, A057363, A057364, A057365, A057366, A057367.
Sequence in context: A083055 A195072 A121828 * A029123 A025777 A194200
Adjacent sequences: A057354 A057355 A057356 * A057358 A057359 A057360
|
|
|
KEYWORD
| nonn,easy
|
|
|
AUTHOR
| Mitch Harris (Harris.Mitchell(AT)mgh.harvard.edu)
|
| |
|
|
