Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A130257
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A130257 Partial sums of the 'lower' odd Fibonacci Inverse A130255. +0
12
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; listen)
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.

Adjacent sequences: A130254 A130255 A130256 this_sequence A130258 A130259 A130260

Sequence in context: A037030 A075782 A050090 this_sequence A079511 A062430 A016040

KEYWORD

nonn

AUTHOR

Hieronymus Fischer (Hieronymus.Fischer(AT)gmx.de), May 24 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 May 16 23:01 EDT 2008. Contains 139884 sequences.


AT&T Labs Research