|
|
A065451
|
|
a(n) = Fibonacci(phi(n)), a(0) = 0.
|
|
5
|
|
|
0, 1, 1, 1, 1, 3, 1, 8, 3, 8, 3, 55, 3, 144, 8, 21, 21, 987, 8, 2584, 21, 144, 55, 17711, 21, 6765, 144, 2584, 144, 317811, 21, 832040, 987, 6765, 987, 46368, 144, 14930352, 2584, 46368, 987, 102334155, 144, 267914296, 6765, 46368, 17711, 1836311903
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
0,6
|
|
LINKS
|
|
|
FORMULA
|
a(n) <= A065449(n), with equality if and only if n = 1, 2 or 3 (Luca, 1999). - Amiram Eldar, Jan 12 2022
|
|
EXAMPLE
|
a(13) = F(phi(13)) = F(12) = 144.
|
|
MATHEMATICA
|
Table[ Fibonacci[ EulerPhi[ n]], {n, 0, 60} ]
|
|
PROG
|
(PARI) for(n=1, 75, print1(fibonacci(eulerphi(n)), ", "))
(PARI) { for (n=0, 1000, if (n, a=fibonacci(eulerphi(n)), a=0); write("b065451.txt", n, " ", a) ) } \\ Harry J. Smith, Oct 20 2009
(Magma) [0] cat [Fibonacci(EulerPhi(n)): n in [1..50]]; // G. C. Greubel, Jan 18 2018
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
EXTENSIONS
|
More terms from several correspondents, Nov 19 2001
|
|
STATUS
|
approved
|
|
|
|