login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A137203 Number of Fibonacci numbers less than or equal to n^2. 1
1, 3, 5, 7, 8, 9, 10, 10, 11, 11, 12, 12, 13, 13, 13, 13, 14, 14, 14, 14, 15, 15, 15, 15, 15, 16, 16, 16, 16, 16, 16, 16, 17, 17, 17, 17, 17, 17, 17, 17, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,2
LINKS
FORMULA
a(n) = A108852(n^2). - Michel Marcus, Aug 03 2014
EXAMPLE
When n=1, the number of Fibonacci numbers less than or equal to 1 is 3.
When n=2, the number of Fibonacci numbers less than or equal to 4 is 5.
When n=3, the number of Fibonacci numbers less than or equal to 9 is 7.
When n=4, the number of Fibonacci numbers less than or equal to 16 is 8.
MATHEMATICA
fibPi[n_] := 1 + Floor[ Log[ GoldenRatio, 1 + n*Sqrt@ 5]]; Array[ fibPi[#^2] &, 80, 0] (* Robert G. Wilson v, Aug 03 2014 *)
PROG
(PARI) first(n) = { res = vector(n+1); fibs = List([0, 1]); i = 2; n2 = n^2; f = 1; while(f <= n2, listput(fibs, f); i++; f = fibonacci(i) ); for(i = 1, #fibs, res[ceil(sqrt(fibs[i]))+1]++ ); for(i = 2, #res, res[i]+=res[i-1]); res} \\ David A. Corneth, Mar 28 2021
CROSSREFS
Sequence in context: A163301 A036593 A086674 * A102890 A008520 A217129
KEYWORD
nonn
AUTHOR
Parthasarathy Nambi, Apr 04 2008
EXTENSIONS
Corrected and extended by Robert G. Wilson v, Aug 03 2014
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 25 03:15 EDT 2024. Contains 371964 sequences. (Running on oeis4.)