Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A072371
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A072371 a(0) = 0, a(1) = 1, a(n+1) = 2*a(n) + (2*n-1)^2*a(n-1). +0
1
1, 2, 5, 28, 181, 1734, 18129, 246072, 3555945, 62478090, 1152624285, 24859839060, 558026987805, 14266908838350, 377300685054825, 11155177913266800, 339620231957641425, 11399366438564677650, 392645165479000867125, 14749514218199731855500, 567030259977151650805125 (list; graph; listen)
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.

Adjacent sequences: A072368 A072369 A072370 this_sequence A072372 A072373 A072374

Sequence in context: A025170 A095159 A047132 this_sequence A019043 A009635 A138293

KEYWORD

nonn

AUTHOR

njas, Jul 19 2002

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 October 13 20:18 EDT 2008. Contains 145016 sequences.


AT&T Labs Research