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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A130257 Partial sums of the 'lower' odd Fibonacci Inverse A130255. 11
1, 3, 5, 7, 10, 13, 16, 19, 22, 25, 28, 31, 35, 39, 43, 47, 51, 55, 59, 63, 67, 71, 75, 79, 83, 87, 91, 95, 99, 103, 107, 111, 115, 120, 125, 130, 135, 140, 145, 150, 155, 160, 165, 170, 175, 180, 185, 190, 195, 200, 205, 210, 215, 220, 225, 230, 235, 240, 245, 250 (list; graph; refs; listen; history; internal format)
OFFSET

1,2

FORMULA

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

CROSSREFS

Cf. A000045, A001519, A001906, A130233, A130235, A130236, A130256, A130258, A104161. Lucas inverse: A130241 - A130248.

Sequence in context: A050090 A152004 A198409 * A186148 A079511 A092757

Adjacent sequences:  A130254 A130255 A130256 * A130258 A130259 A130260

KEYWORD

nonn

AUTHOR

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

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 04:58 EST 2012. Contains 205985 sequences.