Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A081662
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A081662 Partial sums of n+F(n+1). +0
2
1, 3, 7, 13, 22, 35, 54, 82, 124, 188, 287, 442, 687, 1077, 1701, 2703, 4316, 6917, 11116, 17900, 28866, 46598, 75277, 121668, 196717, 318135, 514579, 832417, 1346674, 2178743, 3525042, 5703382, 9227992, 14930912, 24158411, 39088798 (list; graph; listen)
OFFSET

0,2

FORMULA

a(n)=(1-2sqrt(5)/5)(sqrt(5)/2-1/2)^n(-1)^n+(sqrt(5)/2+1/2)^n(2sqrt(5)/5+1)+(n^2+n-2)/2 G.f.: (x^3+x-1)/((1-x)^3(x^2+x-1))

Row sums of triangle A132923, = binomial transform of (1, 2, 2, 0, 1, -1, 2, -3, 5, -8,...). - Gary W. Adamson (qntmpkt(AT)yahoo.com), Sep 05 2007

CROSSREFS

Cf. A081659, A000045.

Cf. A132923.

Adjacent sequences: A081659 A081660 A081661 this_sequence A081663 A081664 A081665

Sequence in context: A078582 A051336 A002623 this_sequence A091652 A134197 A053001

KEYWORD

easy,nonn

AUTHOR

Paul Barry (pbarry(AT)wit.ie), Mar 26 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 October 13 20:18 EDT 2008. Contains 145016 sequences.


AT&T Labs Research