The On-Line Encyclopedia of Integer Sequences (OEIS)

Revision History for A137592

(Bold, blue-underlined text is an addition; faded, red-underlined text is a ~~deletion~~.)
Showing all changes.

A137592

Duplicate of A098694.
(history; published version)

#9 by Bruno Berselli at Sat Oct 12 16:00:23 EDT 2013

STATUS

proposed

approved

#8 by R. J. Mathar at Sat Oct 12 14:47:22 EDT 2013

STATUS

editing

proposed

#7 by R. J. Mathar at Sat Oct 12 14:47:12 EDT 2013

NAME

Hankel transform of double factorial numbers A001147.

Duplicate of A098694.

KEYWORD

easy,nonn

dead

STATUS

approved

editing

#6 by T. D. Noe at Fri Jun 14 13:36:03 EDT 2013

STATUS

proposed

approved

#5 by Sergei N. Gladkovskii at Fri Jun 14 12:15:43 EDT 2013

STATUS

editing

proposed

#4 by Sergei N. Gladkovskii at Fri Jun 14 12:15:34 EDT 2013

FORMULA

G.f.: G(0)/2, where G(k)= 1 + 1/(1 - 1/(1 + 1/(2*k+2)!/x/G(k+1))); (continued fraction). - Sergei N. Gladkovskii, Jun 14 2013

STATUS

approved

editing

#3 by Russ Cox at Fri Mar 30 18:59:20 EDT 2012

COMMENTS

Hankel transform of A112934(n+1). [From _Paul Barry (pbarry(AT)wit.ie), _, Dec 04 2009]

AUTHOR

_Paul Barry (pbarry(AT)wit.ie), _, Jan 28 2008

Discussion

Fri Mar 30

18:59

OEIS Server: https://oeis.org/edit/global/287

#2 by N. J. A. Sloane at Tue Jun 01 03:00:00 EDT 2010

COMMENTS

Hankel transform of A112934(n+1). [From Paul Barry (pbarry(AT)wit.ie), Dec 04 2009]

KEYWORD

easy,nonn,new

#1 by N. J. A. Sloane at Sun Jun 29 03:00:00 EDT 2008

NAME

Hankel transform of double factorial numbers A001147.

DATA

1, 2, 48, 34560, 1393459200, 5056584744960000, 2422112183371431936000000, 211155601241022491077587763200000000, 4417964278440225627098723475313498521600000000000

OFFSET

0,2

FORMULA

a(n)=Product{k=0..n, (2(k+1)(2k+1))^(n-k)}; a(n)=A000178(n)*A057863(n)*A006125(n+1)=A121835(n)*A006125(n+1);

KEYWORD

easy,nonn

AUTHOR

Paul Barry (pbarry(AT)wit.ie), Jan 28 2008

STATUS

approved