Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A130261
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A130261 Partial sums of the 'lower' even Fibonacci Inverse A130259. +0
10
0, 1, 2, 4, 6, 8, 10, 12, 15, 18, 21, 24, 27, 30, 33, 36, 39, 42, 45, 48, 51, 55, 59, 63, 67, 71, 75, 79, 83, 87, 91, 95, 99, 103, 107, 111, 115, 119, 123, 127, 131, 135, 139, 143, 147, 151, 155, 159, 163, 167, 171, 175, 179, 183, 187, 192, 197, 202, 207, 212, 217 (list; graph; listen)
OFFSET

0,3

FORMULA

a(n)=(n+1)*A130259(n)-A001519(A130259(n)+1)+1=(n+1)*A130259(n)-Fib(2*A130259(n)+1)+1. G.f.: g(x)=1/(1-x)^2*sum(k>=1, x^Fib(2k)).

CROSSREFS

Cf. A000045, A001519, A001906, A130233, A130235, A130236, A130255, A130257, A104162. Lucas inverse: A130241 - A130248.

Sequence in context: A111905 A064997 A113903 this_sequence A011860 A049445 A002174

Adjacent sequences: A130258 A130259 A130260 this_sequence A130262 A130263 A130264

KEYWORD

nonn

AUTHOR

Hieronymus Fischer (Hieronymus.Fischer(AT)gmx.de), May 25 2007

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 August 29 17:54 EDT 2008. Contains 143238 sequences.


AT&T Labs Research