|
Search: id:A065557
|
|
|
| A065557 |
|
Solutions n of the equation phi(n) = phi(n-1) + phi(n-2). |
|
+0
5
|
|
| 3, 5, 7, 11, 17, 23, 37, 41, 47, 101, 137, 233, 257, 857, 1037, 1297, 1541, 1601, 2017, 4337, 6527, 9179, 14401, 16097, 30497, 55387, 61133, 62801, 65537, 72581, 77617, 110177, 152651, 179297, 244967, 299651, 603461, 619697, 686737, 1876727
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
COMMENT
|
All terms listed here are square-free. (Thanks to Vladeta Jovovic for this observation.) Prove or disprove: a(n) is always square-free.
|
|
REFERENCES
|
A. H. Beiler, Recreations in the Theory of Numbers, Dover Pub., NY 1966.
|
|
LINKS
|
Harry J. Smith, Table of n, a(n) for n=1,...,85
J. L. Pe, On Solutions of phi(n) = phi(n-1) + phi(n-2): A Problem Proposal
|
|
EXAMPLE
|
phi(23) = 22 = 10 + 12 = phi(22) + phi(21), phi(101) = 100 = 40 + 60 = phi(100) + phi(99).
|
|
MATHEMATICA
|
Select[ Range[3, 10^6], EulerPhi[ # ] == EulerPhi[ # - 1] + EulerPhi[ # - 2] & ]
|
|
PROGRAM
|
(PARI): for(n=3, 10^8, if(eulerphi(n)==eulerphi(n-1)+eulerphi(n-2), print1(n, ", ")))
(PARI) { n=0; e1=eulerphi(2); e2=eulerphi(1); for (m=3, 10^9, e=eulerphi(m); if (e==e2 + e1, write("b065557.txt", n++, " ", m); if (n==100, return)); e2=e1; e1=e ) } [From Harry J. Smith (hjsmithh(AT)sbcglobal.net), Oct 22 2009]
|
|
CROSSREFS
|
Cf. A000010. A065572 gives nonprime solutions.
Sequence in context: A144574 A108539 A090919 this_sequence A152999 A024967 A135246
Adjacent sequences: A065554 A065555 A065556 this_sequence A065558 A065559 A065560
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Joseph L. Pe (joseph_l_pe(AT)hotmail.com), Nov 28 2001
|
|
EXTENSIONS
|
More terms from Jason Earls (zevi_35711(AT)yahoo.com), Robert G. Wilson v (rgwv(AT)rgwv.com) and Dean Hickerson (dean.hickerson(AT)yahoo.com), Nov 30 2001
|
|
|
Search completed in 0.002 seconds
|
