Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A130237
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A130237 The 'lower' Fibonacci Inverse A130233(n) multiplied by n. +0
9
0, 2, 6, 12, 16, 25, 30, 35, 48, 54, 60, 66, 72, 91, 98, 105, 112, 119, 126, 133, 140, 168, 176, 184, 192, 200, 208, 216, 224, 232, 240, 248, 256, 264, 306, 315, 324, 333, 342, 351, 360, 369, 378, 387, 396, 405, 414, 423, 432, 441, 450, 459, 468, 477, 486, 550 (list; graph; listen)
OFFSET

0,2

FORMULA

a(n)=n*max(k | Fib(k)<=n)=n*A130233(n)=n*floor(arsinh(sqr(5)*n/2)/ln(phi)). G.f.: g(x)=1/(1-x)*sum{k>=1, (Fib(k)+x/(1-x))*x^Fib(k)}.

CROSSREFS

Partial sums: A130238. Other related sequences: A000045, A130233, A130234, A130235, A130236, A130238, A130239, A130240, A130243, A130246, A130248, A130239, A130251, A130253, A130257, A130261.

Sequence in context: A143408 A088915 A084790 this_sequence A053457 A154030 A055560

Adjacent sequences: A130234 A130235 A130236 this_sequence A130238 A130239 A130240

KEYWORD

nonn

AUTHOR

Hieronymus Fischer (Hieronymus.Fischer(AT)gmx.de), May 17 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 December 16 17:18 EST 2009. Contains 170825 sequences.


AT&T Labs Research