Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A088016
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A088016 To obtain a(n), add the square of the n-th partial sum to the n-th partial sum of the squares, then divide this result by a(n-1), for all n>1, with a(0)=1, a(1)=1. +0
1
1, 1, 6, 17, 56, 179, 576, 1851, 5950, 19125, 61474, 197597, 635140, 2041543, 6562172, 21092919, 67799386, 217928905, 700493182, 2251609065, 7237391472, 23263290299, 74775653304, 240352858739, 772570939222, 2483290023101 (list; graph; listen)
OFFSET

0,3

FORMULA

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

PROGRAM

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

CROSSREFS

Cf. A030186, A087640.

Sequence in context: A054492 A128525 A083334 this_sequence A010330 A109311 A006758

Adjacent sequences: A088013 A088014 A088015 this_sequence A088017 A088018 A088019

KEYWORD

nonn

AUTHOR

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

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 July 26 23:19 EDT 2008. Contains 142293 sequences.


AT&T Labs Research