id:A126934 - OEIS Search Results

Search: id:A126934

Displaying 1-1 of 1 results found.

page 1

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

+0
2

1, -2, 36, -1800, 176400, -28576800, 6915585600, -2337467932800, 1051860569760000, -607975409321280000, 438958245529964160000, -387161172557428389120000, 409616520565759235688960000, -512020650707199044611200000000, 746526108731096207043129600000000, -1255656914885703820246543987200000000 (list; graph; listen)

	OFFSET	`0,2`
	REFERENCES	`V. van der Noort and N. J. A. Sloane, Paper in preparation, 2007.`
	FORMULA	`a(n) = A001147(n) * A001813(n). - njas, Mar 21 2007`
	CROSSREFS	`See A105937 for the full array. See also A127080.` `Sequence in context: A003092 A046673 A088026 this_sequence A001070 A095229 A047832` `Adjacent sequences: A126931 A126932 A126933 this_sequence A126935 A126936 A126937`
	KEYWORD	`sign`
	AUTHOR	`Vincent v.d. Noort, Mar 21 2007`

page 1

Search completed in 0.002 seconds

Last modified July 26 23:19 EDT 2008. Contains 142293 sequences.

AT&T Labs Research