|
Search: id:A065449
|
|
| |
|
| 0, 1, 1, 1, 2, 4, 4, 12, 12, 16, 40, 88, 48, 232, 336, 240, 552, 1596, 1152, 4032, 3200, 5040, 17424, 28656, 12672, 60000, 120640, 89856, 188160, 514228, 288000, 1343296, 1217712, 1742400, 5697720, 6814080, 4396032, 23656320, 37691136
(list; graph; listen)
|
|
|
OFFSET
|
0,5
|
|
|
COMMENT
|
n=467 takes too long. [From Harry J. Smith (hjsmithh(AT)sbcglobal.net), Oct 20 2009]
|
|
LINKS
|
Harry J. Smith, Table of n, a(n) for n=0,...,466
Joseph L. Pe, The Euler Phibonacci Sequence: A Problem Proposal with Software
|
|
EXAMPLE
|
a(9) = phi(F(9)) = phi(34) = phi(2 * 17) = 16.
|
|
MAPLE
|
with(numtheory):with(combinat):a:=n->phi(fibonacci(n)): seq(a(n), n=0..38); - Zerinvary Lajos (zerinvarylajos(AT)yahoo.com), Oct 07 2007
|
|
MATHEMATICA
|
Table[ EulerPhi[ Fibonacci[ n]], {n, 0, 46} ]
|
|
PROGRAM
|
(PARI) for(n=1, 75, print1(eulerphi(fibonacci(n)), ", "))
(Other) sage: [euler_phi(fibonacci(n))for n in xrange(0, 39)]# [From Zerinvary Lajos (zerinvarylajos(AT)yahoo.com), Jun 06 2009]
(PARI) { for (n=0, 466, if (n, a=eulerphi(fibonacci(n)), a=0); write("b065449.txt", n, " ", a) ) } [From Harry J. Smith (hjsmithh(AT)sbcglobal.net), Oct 20 2009]
|
|
CROSSREFS
|
A000010(A000045(n)). Cf. A065451.
Sequence in context: A121049 A056415 A000936 this_sequence A130618 A129882 A129017
Adjacent sequences: A065446 A065447 A065448 this_sequence A065450 A065451 A065452
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Joseph L. Pe (joseph_l_pe(AT)hotmail.com), Nov 18 2001
|
|
EXTENSIONS
|
More terms from several correspondents, Nov 19, 2001
|
|
|
Search completed in 0.002 seconds
|
