|
|
A160599
|
|
Composite numbers n for which n - phi(n) divides n-1.
|
|
3
|
|
|
15, 85, 255, 259, 391, 589, 1111, 3193, 4171, 4369, 12361, 17473, 21845, 25429, 28243, 47989, 52537, 65535, 65641, 68377, 83767, 91759, 100777, 120019, 144097, 167743, 186367, 268321, 286357, 291919, 316171, 327937, 335923, 346063, 353029
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,1
|
|
COMMENTS
|
Obviously, C(p) = (p-phi(p))/(p-1) = 1/(p-1), i.e., A160598(p)=1, for all primes p. This sequence lists composite numbers for which C(n) has denominator 1, i.e., n-1 is a multiple of n - phi(n).
The sequence contains numbers F(k)*F(k+1)*...*F(k+d), if the factors are successive Fermat primes F(k)=2^(2^k)+1.
|
|
LINKS
|
|
|
EXAMPLE
|
a(1)=15 is in the sequence, because for n=15, we have (n - phi(n))/(n-1) = (15-8)/14 = 1/2; apart from the primes, this is the smallest number n such that C(n) is a unit fraction.
|
|
MATHEMATICA
|
Select[Range[400000], CompositeQ[#]&&Divisible[#-1, #-EulerPhi[#]]&] (* Harvey P. Dale, Apr 23 2019 *)
|
|
PROG
|
(PARI) for(n=2, 10^9, isprime(n) & next; (n-1)%(n-eulerphi(n)) | print1(n", "))
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|