The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 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 Antti Karttunen, Table of n, a(n) for n = 0..8191 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)). a(n) = A105198(n+1). - R. J. Mathar, Jun 08 2008 MATHEMATICA Table[Mod[Binomial[n+2, n], 4], {n, 0, 120}]  (* Harvey P. Dale, Apr 16 2011 *) PROG (PARI) A133882(n) = (binomial(n+2, n) % 4); \\ Antti Karttunen, Aug 10 2017 CROSSREFS Cf. A000040, A133620-A133625, A133630, A038509, A133634-A133636. Cf. A133872, A133880, A133890, A133900, A133910. For the sequence regarding "binomial(n+2, n) mod 2" see A133872. A105198 shifted once left. Sequence in context: A006379 A217956 A105198 * A092106 A278885 A183049 Adjacent sequences:  A133879 A133880 A133881 * A133883 A133884 A133885 KEYWORD nonn,easy AUTHOR Hieronymus Fischer, Oct 10 2007 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified August 9 11:08 EDT 2020. Contains 336323 sequences. (Running on oeis4.)