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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A036242 Numerator of fraction equal to the continued fraction [0,2,4,...2n]. 4
1, 4, 25, 204, 2065, 24984, 351841, 5654440, 102131761, 2048289660, 45164504281, 1085996392404, 28281070706785, 792955976182384, 23816960356178305, 762935687373888144, 25963630331068375201, 935453627605835395380, 35573201479352813399641, 1423863512801718371381020 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

LINKS

Table of n, a(n) for n=1..20.

FORMULA

Recurrence equation: a(n+1) = (2*n+2)*a(n) + a(n-1) with a(0) = 1 and a(1) = 1.

a(n) = Sum_{k = 0..floor((n-1)/2)} 2^(n-2*k-1)*(n-2*k-1)!*binomial(n-k-1,k)*binomial(n-k,k+1). Cf. A058798. - Peter Bala, Aug 01 2013

a(n) = 2^(n-1)*n!*hypergeometric([(1-n)/2, 1-n/2],[2, 1-n, -n], 1) for n>=2. - Peter Luschny, Sep 14 2014

MATHEMATICA

a[n_] := FromContinuedFraction[Range[0, 2n, 2]] // Numerator; Array[a, 20] (* Jean-Fran├žois Alcover, Jun 03 2019 *)

PROG

(Sage)

def A036242(n):

    if n == 1: return 1

    return 2^(n-1)*factorial(n)*hypergeometric([1/2 - n/2, 1 - n/2], [2, 1-n, -n], 1)

[round(A036242(n).n(100)) for n in (1..20)] # Peter Luschny, Sep 14 2014

CROSSREFS

Cf. A036243. A058798.

Sequence in context: A088159 A301363 A213192 * A120955 A061714 A005411

Adjacent sequences:  A036239 A036240 A036241 * A036243 A036244 A036245

KEYWORD

frac,nonn,easy

AUTHOR

Jeff Burch

STATUS

approved

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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified July 12 13:04 EDT 2020. Contains 335661 sequences. (Running on oeis4.)