A133882 - OEIS

The OEIS is supported by the many generous donors to the OEIS Foundation.

A133882

a(n) = binomial(n+2,n) mod 2^2.

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

Antti Karttunen, Table of n, a(n) for n = 0..8191

Index entries for linear recurrences with constant coefficients, signature (1, -1, 1, -1, 1, -1, 1).

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)).