|
Search: id:A108852
|
|
|
| A108852 |
|
Number of Fibonacci numbers <= n. |
|
+0
9
|
|
| 1, 3, 4, 5, 5, 6, 6, 6, 7, 7, 7, 7, 7, 8, 8, 8, 8, 8, 8, 8, 8, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11
(list; graph; listen)
|
|
|
OFFSET
|
0,2
|
|
|
FORMULA
|
G.f.: (Sum_{n>=0} x^Fibonacci(n))/(1-x). - Vladeta Jovovic (vladeta(AT)eunet.rs), Nov 27 2005
a(n)=1+floor(log_phi((sqr(5)*n+sqr(5*n^2+4))/2)), n>=0, where phi is the golden ratio. Alternatively, a(n)=1+floor(arsinh(sqr(5)*n/2)/ln(phi)). Also a(n)=A072649(n)+2. - Hieronymus Fischer (Hieronymus.Fischer(AT)gmx.de), May 02 2007
a(n)=1+floor(log_phi(sqr(5)*n+1)), n>=0, where phi is the = golden ratio. - Hieronymus Fischer (Hieronymus.Fischer(AT)gmx.de), Jul 02 2007
|
|
PROGRAM
|
(Haskell) fibs :: [Integer]
fibs = 0 : 1 : zipWith (+) fibs (tail fibs)
fibs_to :: Integer -> Integer
fibs_to n = length $ takeWhile (<= n) fibs
|
|
CROSSREFS
|
Cf. A060384, A072649.
Sequence in context: A098200 A092405 A130234 this_sequence A119476 A037038 A106501
Adjacent sequences: A108849 A108850 A108851 this_sequence A108853 A108854 A108855
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Michael C. Vanier (mvanier(AT)cs.caltech.edu), Nov 27 2005
|
|
|
Search completed in 0.002 seconds
|
