Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A133882
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A133882 Binomial(n+2,n) mod 2^2. +0
5
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; listen)
OFFSET

0,2

COMMENT

Periodic with length 2^3=8.

FORMULA

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

G.f. g(x)=(1+3x+2x^2+2x^3+3x^4+x^5)/(1-x^8).

G.f. g(x)=(1+x)(1+2x+2x^3+x^4)/(1-x^8)=(1+2x+2x^3+x^4)/((1-x)(1+x^2)(1+x^4))

a(n)=A105198(n+1). - R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Jun 08 2008

a(n)=(1/56)*{-4*(n mod 8)+3*[(n+1) mod 8]+10*[(n+2) mod 8]+17*[(n+3) mod 8]-4*[(n+4) mod 8]+3*[(n+5) mod 8]+10*[(n+6) mod 8]-11*[(n+7) mod 8]}, with n>=0 [From Paolo P. Lava (ppl(AT)spl.at), Oct 06 2008]

a(n)=1.5 + 0*( - 1)^n - 0.5*cos(Pi*n/4) + (1/2 + 1/2*2^(1/2))*sin(Pi*n/4) - 0.5*cos(3*Pi*n/4) + ( - 1/2 + 1/2*2^(1/2))*sin(3*Pi*n/4) + 0.5*cos(n*Pi/2) + 0.5*sin(n*Pi/2) [From Richard Choulet (richardchoulet(AT)yahoo.fr), Dec 12 2008]

CROSSREFS

Cf. A000040, A133620-A133625, A133630, A133633-A133636.

Cf. A133872, A133880, A133890, A133900, A133910.

For the sequence regarding "binomial(n+2, n) mod 2" see A133872.

Sequence in context: A073756 A006379 A105198 this_sequence A092106 A052901 A127807

Adjacent sequences: A133879 A133880 A133881 this_sequence A133883 A133884 A133885

KEYWORD

nonn

AUTHOR

Hieronymus Fischer (Hieronymus.Fischer(AT)gmx.de), Oct 10 2007

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified November 27 22:38 EST 2009. Contains 167602 sequences.


AT&T Labs Research