|
|
A133882
|
|
a(n) = binomial(n+2,n) mod 2^2.
|
|
6
|
|
|
1, 3, 2, 2, 3, 1, 0, 0, 1, 3, 2, 2, 3, 1, 0, 0, 1, 3, 2, 2, 3, 1, 0, 0, 1, 3, 2, 2, 3, 1, 0, 0, 1, 3, 2, 2, 3, 1, 0, 0, 1, 3, 2, 2, 3, 1, 0, 0, 1, 3, 2, 2, 3, 1, 0, 0, 1, 3, 2, 2, 3, 1, 0, 0, 1, 3, 2, 2, 3, 1, 0, 0, 1, 3, 2, 2, 3, 1, 0, 0, 1, 3, 2, 2, 3, 1, 0, 0, 1, 3, 2, 2, 3, 1, 0, 0, 1, 3, 2, 2, 3, 1, 0, 0, 1
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
0,2
|
|
COMMENTS
|
Periodic with length 2^3 = 8.
|
|
LINKS
|
|
|
FORMULA
|
a(n) = binomial(n+2,2) mod 2^2.
G.f.: (1 + 3*x + 2*x^2 + 2*x^3 + 3*x^4 + x^5)/(1-x^8).
G.f.: (1+x)*(1+2*x+2*x^3+x^4)/(1-x^8) = (1+2*x+2*x^3+x^4)/((1-x)*(1+x^2)*(1+x^4)).
|
|
MATHEMATICA
|
Table[Mod[Binomial[n+2, n], 4], {n, 0, 120}] (* Harvey P. Dale, Apr 16 2011 *)
|
|
PROG
|
|
|
CROSSREFS
|
For the sequence regarding "binomial(n+2, n) mod 2" see A133872.
|
|
KEYWORD
|
nonn,easy
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|