Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A130258
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A130258 Partial sums of the 'upper' odd Fibonacci Inverse A130256. +0
5
0, 0, 2, 5, 8, 11, 15, 19, 23, 27, 31, 35, 39, 43, 48, 53, 58, 63, 68, 73, 78, 83, 88, 93, 98, 103, 108, 113, 118, 123, 128, 133, 138, 143, 148, 154, 160, 166, 172, 178, 184, 190, 196, 202, 208, 214, 220, 226, 232, 238, 244, 250, 256, 262, 268, 274, 280, 286, 292 (list; graph; listen)
OFFSET

0,3

FORMULA

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

CROSSREFS

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

Sequence in context: A102795 A118518 A088366 this_sequence A032765 A129300 A107679

Adjacent sequences: A130255 A130256 A130257 this_sequence A130259 A130260 A130261

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 July 23 17:35 EDT 2008. Contains 142285 sequences.


AT&T Labs Research