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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A087640 To obtain a(n+1), take the square of the n-th partial sum, minus the sum of the first n squared terms, then divide this difference by a(n); for all n>1, starting with a(0)=1, a(1)=1. 4
1, 1, 2, 5, 10, 23, 48, 107, 228, 501, 1078, 2353, 5086, 11067, 23972, 52087, 112936, 245225, 531946, 1154685, 2505298, 5437407, 11798616, 25605539, 55563980, 120581981, 261668382, 567850345, 1232273510, 2674156163, 5803126348 (list; graph; refs; listen; history; internal format)
OFFSET

0,3

FORMULA

a(n) = a(n-1) + 3a(n-2) - a(n-3) for n>3; G.f.: (1-2x^2+x^3)/(1-x-3x^2+x^3); A(x) = A052973(x)/(1+x-x^2).

PROG

(PARI) a(n) = ( sum(k=1, n-1, a(k))^2 - sum(k=1, n-1, a(k)^2) )/a(n-1)

CROSSREFS

Cf. A052973.

Sequence in context: A026677 A109165 A018344 * A116953 A099516 A099963

Adjacent sequences:  A087637 A087638 A087639 * A087641 A087642 A087643

KEYWORD

nonn

AUTHOR

Paul D. Hanna (pauldhanna(AT)juno.com), Sep 15 2003

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 17 11:46 EST 2012. Contains 206011 sequences.