|
|
A288156
|
|
Two even followed by three odd integers: the pattern is (0+2k, 0+2k, 1+2k, 1+2k, 1+2k) for k >= 0.
|
|
7
|
|
|
0, 0, 1, 1, 1, 2, 2, 3, 3, 3, 4, 4, 5, 5, 5, 6, 6, 7, 7, 7, 8, 8, 9, 9, 9, 10, 10, 11, 11, 11, 12, 12, 13, 13, 13, 14, 14, 15, 15, 15, 16, 16, 17, 17, 17, 18, 18, 19, 19, 19, 20, 20, 21, 21, 21, 22, 22, 23, 23, 23, 24, 24, 25, 25, 25, 26, 26, 27, 27, 27, 28, 28, 29, 29, 29, 30, 30, 31, 31, 31, 32, 32, 33, 33, 33, 34, 34, 35, 35, 35, 36, 36, 37, 37, 37, 38, 38, 39, 39, 39, 40
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
0,6
|
|
COMMENTS
|
a(n) = number of odd integers divisible by 5 in the interval ]2*(n-1)^2, 2*n^2[.
|
|
LINKS
|
|
|
FORMULA
|
a(5*k + r) = floor((r + 3)/5) + 2*k for k >= 0 and r < 5. - David A. Corneth, Jun 25 2017
G.f.: x^2*(x^3+1)/(x^6-x^5-x+1) = x^2 *(1+x) *(1-x+x^2) /( (1-x)^2 * (1+x+x^2+x^3+x^4) ). - Alois P. Heinz, Jul 04 2017
a(n) = 2*a(n-5) - a(n-10).
a(n) = a(n-1) + a(n-5) - a(n-6). (End)
|
|
MATHEMATICA
|
Table[Count[Mod[Table[2 ((n - 1)^2 + k) - 1, {k, 1, 2 n - 1}], 5], 0], {n, 0, 100}]
|
|
CROSSREFS
|
Two zeros followed by partial sums of A232990.
|
|
KEYWORD
|
nonn,easy
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|