login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A072371 a(0) = 0, a(1) = 1, a(n+1) = 2*a(n) + (2*n-1)^2*a(n-1). 0
1, 2, 5, 28, 181, 1734, 18129, 246072, 3555945, 62478090, 1152624285, 24859839060, 558026987805, 14266908838350, 377300685054825, 11155177913266800, 339620231957641425, 11399366438564677650, 392645165479000867125, 14749514218199731855500, 567030259977151650805125 (list; graph; refs; listen; history; internal format)
OFFSET

0,2

REFERENCES

A. E. Jolliffe, Continued Fractions, in Encyclopaedia Britannica, 11th ed., pp. 30-33; see p. 31.

MAPLE

f := proc(n) option remember; local a, b, t1, t2, t3, i, j, k; a := 1; b := 2; if n=0 then RETURN(a) elif n=1 then RETURN(b) else RETURN(2*f(n-1)+ (2*n-3)^2*f(n-2)); fi; end;

CROSSREFS

Cf. A024199, A024200.

Sequence in context: A151775 A095159 A047132 * A019043 A009635 A138293

Adjacent sequences:  A072368 A072369 A072370 * A072372 A072373 A072374

KEYWORD

nonn

AUTHOR

N. J. A. Sloane (njas(AT)research.att.com), Jul 19 2002

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 16 11:43 EST 2012. Contains 205907 sequences.