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

Thanks to everyone who made a donation during our annual appeal!
To see the list of donors, or make a donation, see the OEIS Foundation home page.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A127137 Define an array by Q(m, 0) = 1, Q(m, 1) = 1; Q(m, 2k) = (m - 2k + 1)*Q(m+1, 2k-1) - (2k-1)*Q(m+2, k-2), m*Q(m, 2k+1) = (m - 2k)*Q(m+1, 2k) - 2k(m+1)*Q(m+2, 2k-1). Sequence gives Q(0,n). 7

%I

%S 1,1,-2,-5,12,43,-120,-531,1680,8601,-30240,-172965,665280,4161555,

%T -17297280,-116658675,518918400,3735104625,-17643225600,-134498225925,

%U 670442572800,5380583766075,-28158588057600,-236759435017875,1295295050649600,11364769115001225,-64764752532480000

%N Define an array by Q(m, 0) = 1, Q(m, 1) = 1; Q(m, 2k) = (m - 2k + 1)*Q(m+1, 2k-1) - (2k-1)*Q(m+2, k-2), m*Q(m, 2k+1) = (m - 2k)*Q(m+1, 2k) - 2k(m+1)*Q(m+2, 2k-1). Sequence gives Q(0,n).

%D V. van der Noort and N. J. A. Sloane, Paper in preparation, 2007.

%F See A127080 for e.g.f.

%Y A001813 interleaved with A090470.

%Y See A127080 for the array Q. A column of A127080.

%K sign

%O 0,3

%A _N. J. A. Sloane_, Mar 24 2007

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 January 22 13:36 EST 2020. Contains 331149 sequences. (Running on oeis4.)