Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A127137
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
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). +0
8
1, 1, -2, -5, 12, 43, -120, -531, 1680, 8601, -30240, -172965, 665280, 4161555, -17297280, -116658675, 518918400, 3735104625, -17643225600, -134498225925, 670442572800, 5380583766075, -28158588057600, -236759435017875, 1295295050649600, 11364769115001225, -64764752532480000 (list; graph; listen)
OFFSET

0,3

REFERENCES

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

FORMULA

See A127080 for e.g.f.

CROSSREFS

A001813 interleaved with A090470.

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

Sequence in context: A005664 A009739 A062272 this_sequence A071787 A067578 A109139

Adjacent sequences: A127134 A127135 A127136 this_sequence A127138 A127139 A127140

KEYWORD

sign

AUTHOR

njas, Mar 24 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 September 6 00:03 EDT 2008. Contains 143485 sequences.


AT&T Labs Research