|
|
A048849
|
|
a(n) = prime(phi(n)) + phi(prime(n)).
|
|
3
|
|
|
3, 4, 7, 9, 17, 15, 29, 25, 35, 35, 59, 43, 77, 55, 65, 71, 111, 73, 127, 89, 109, 107, 161, 107, 167, 137, 163, 143, 215, 131, 239, 183, 207, 191, 237, 187, 307, 223, 255, 225, 351, 217, 371, 263, 285, 277, 409, 275, 407, 299, 363, 327, 479, 311, 429, 351, 419
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,1
|
|
COMMENTS
|
I made this up to demonstrate how easy it is to construct dull but unguessable sequences with short descriptions.
|
|
LINKS
|
|
|
MAPLE
|
with(numtheory); [ seq(ithprime(phi(i))+phi(ithprime(i)), i=1..80) ];
|
|
MATHEMATICA
|
Table[Prime[EulerPhi[n]] + EulerPhi[Prime[n]], {n, 100}] (* G. C. Greubel, Feb 22 2024 *)
|
|
PROG
|
(Magma) [NthPrime(EulerPhi(n)) + EulerPhi(NthPrime(n)) : n in [1..100]]; // G. C. Greubel, Feb 22 2024
(SageMath) [nth_prime(euler_phi(n)) + euler_phi(nth_prime(n)) for n in range(1, 101)] # G. C. Greubel, Feb 22 2024
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,easy
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|