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!)
 A130713 a(0)=a(2)=1, a(1)=2, a(n)=0 for n>2. 3
 1, 2, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,2 COMMENTS Self-convolution of A019590. Up to a sign the convolutional inverse of the natural numbers sequence. - Tanya Khovanova, Jul 14 2007 LINKS FORMULA G.f.: 1+2*x+x^2. a(n) = [C((n+2)^2,n+4) mod 2] + 2*[C((n+1)^2,n+3) mod 2] +[C(n^2,n+2) mod 2]. - Paolo P. Lava, Dec 19 2007 a(n) = binomial(2n, n^2). - Wesley Ivan Hurt, Mar 08 2014 MAPLE A130713:=n->binomial(2*n, n^2); seq(A130713(n), n=0..100); # Wesley Ivan Hurt, Mar 08 2014 MATHEMATICA Table[Binomial[2 n, n^2], {n, 0, 100}] (* Wesley Ivan Hurt, Mar 08 2014 *) CROSSREFS Sequence in context: A230093 A033322 A329679 * A236619 A300828 A297246 Adjacent sequences:  A130710 A130711 A130712 * A130714 A130715 A130716 KEYWORD easy,nonn AUTHOR Paul Curtz and Tanya Khovanova, Jul 01 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 8 02:45 EDT 2020. Contains 336290 sequences. (Running on oeis4.)