login
This site is supported by donations to The OEIS Foundation.

 

Logo

Please make a donation to keep the OEIS running. We are now in our 55th year. In the past year we added 12000 new sequences and reached 8000 citations (which often say "discovered thanks to the OEIS"). We need to raise money to hire someone to manage submissions, which would reduce the load on our editors and speed up editing.
Other ways to donate

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A199575 a(n) = floor(Fibonacci(n)^(1/4)). 1
0, 1, 1, 1, 1, 1, 1, 1, 2, 2, 2, 3, 3, 3, 4, 4, 5, 6, 7, 8, 9, 10, 11, 13, 14, 16, 18, 21, 23, 26, 30, 34, 38, 43, 48, 55, 62, 70, 79, 89, 100, 113, 127, 144, 162, 183, 207, 233, 263, 296, 334, 377, 426, 480, 541, 611, 689, 777, 876, 989, 1115, 1258, 1418, 1600, 1804, 2035, 2295, 2589, 2920, 3293, 3714, 4189, 4725, 5329, 6010, 6778 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,9

COMMENTS

The Ferraro problem asks for a proof that, for n>=9, floor(F(n)^(1/4)) = floor(F(n-4)^(1/4)+F(n-8)^(1/4)). As of November 2005 this problem remained unsolved.

LINKS

Vincenzo Librandi, Table of n, a(n) for n = 0..1000

P. J. Ferraro, Problem B-886, Fibonacci Q., 37 (No. 4, Nov. 1999); 43 (No. 4, Nov. 2005), p. 372.

MATHEMATICA

Table[Floor[Fibonacci[n]^(1/4)], {n, 0, 80}] (* Vincenzo Librandi, Aug 28 2016 *)

PROG

(MAGMA) [Floor(Fibonacci(n)^(1/4)): n in [0..80]]; // Vincenzo Librandi, Aug 28 2016

(PARI) a(n) = sqrtnint(fibonacci(n), 4); \\ Michel Marcus, Aug 28 2016

CROSSREFS

Cf. A061287.

Sequence in context: A154403 A053265 A035452 * A120187 A029062 A219502

Adjacent sequences:  A199572 A199573 A199574 * A199576 A199577 A199578

KEYWORD

nonn

AUTHOR

N. J. A. Sloane, Nov 09 2011

STATUS

approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified December 13 03:41 EST 2019. Contains 329968 sequences. (Running on oeis4.)