|
Search: id:A057353
|
|
| |
|
| 0, 0, 1, 2, 3, 3, 4, 5, 6, 6, 7, 8, 9, 9, 10, 11, 12, 12, 13, 14, 15, 15, 16, 17, 18, 18, 19, 20, 21, 21, 22, 23, 24, 24, 25, 26, 27, 27, 28, 29, 30, 30, 31, 32, 33, 33, 34, 35, 36, 36, 37, 38, 39, 39, 40, 41, 42, 42, 43, 44, 45, 45, 46, 47, 48, 48, 49, 50, 51, 51, 52, 53, 54
(list; graph; listen)
|
|
|
OFFSET
|
0,4
|
|
|
COMMENT
|
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 entries for sequences related to Beatty sequences
|
|
FORMULA
|
G.f.: (1+x+x^2)*x^2/((1-x)*(1-x^4)) - Bruce Corrigan (scentman(AT)myfamily.com), Jul 03 2002
For all m>=0 a(4m)=0 mod 3; a(4m+1)=0 mod 3; a(4m+2)= 1 mod 3; a(4m+3) = 2 mod 3
|
|
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: A086525 A120503 A083544 this_sequence A076539 A074184 A093700
Adjacent sequences: A057350 A057351 A057352 this_sequence A057354 A057355 A057356
|
|
KEYWORD
|
nonn,easy
|
|
AUTHOR
|
Mitch Harris (Harris.Mitchell(AT)mgh.harvard.edu)
|
|
|
Search completed in 0.002 seconds
|
