Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A159605
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A159605 E.g.f: Sum_{n>=1} a(n)*x^(2n-1)/(2n-1)! = Series_Reversion of e.g.f. S(x) of A159601. +0
1
1, 3, 63, 3465, 363825, 62214075, 15740160975, 5524796502225, 2569030373534625, 1528573072253101875, 1132672646539548489375, 1022803399825212285905625, 1105650475211054481063980625, 1409704355894094463356575296875 (list; graph; listen)
OFFSET

1,2

FORMULA

a(n) = Product_{k=1..n} (2k-3)(4k-5).

EXAMPLE

E.g.f.: A(x) = x + 3*x^3/3! + 63*x^5/5! + 3465*x^7/7! +...

A(S(x)) = x where S(x) = Sum_{n>=1} A159601(n)*x^(2n-1)/(2n-1)! :

S(x) = x - 3*x^3/3! + 27*x^5/5! - 441*x^7/7! + 11529*x^9/9! +...

PROGRAM

(PARI) a(n)=prod(k=1, n, (2*k-3)*(4*k-5))

CROSSREFS

Cf. A159601.

Sequence in context: A139293 A133275 A123687 this_sequence A156904 A053857 A037108

Adjacent sequences: A159602 A159603 A159604 this_sequence A159606 A159607 A159608

KEYWORD

nonn

AUTHOR

Paul D. Hanna (pauldhanna(AT)juno.com), May 11 2009

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 22 15:28 EST 2009. Contains 167310 sequences.


AT&T Labs Research