OFFSET
1,2
COMMENTS
Note that all terms so far are palindromes.
It is obvious that if n is a term of the sequence greater than 1 then n is prime iff n is a palindrome. Do there exist composite terms in the sequence? - Farideh Firoozbakht, Jan 28 2006 Answer: Yes, see next comment.
Giovanni Resta writes (Sep 06 2006): The smallest composite number such that n+rev(n)=phi(n)+sigma(n) is n = 3197267223 = 3 * 79 * 677 * 19927 with rev(n) = 3227627913, phi(n) = 2101316256, sigma(n) = 4323578880 and 3197267223+3227627913 = 6424895136 = 2101316256+4323578880.
LINKS
Vincenzo Librandi, Table of n, a(n) for n = 1..700
FORMULA
If p is prime and rev(p)=p then p+rev(p)=2p=phi(p)+sigma(p) so all palindromic primes are in the sequence. - Farideh Firoozbakht, Sep 12 2006
EXAMPLE
phi(101) + sigma(101) = 202 = 101 + 101 = 101 + reversal(101).
MATHEMATICA
Select[Range[5*10^4], EulerPhi[ # ] + DivisorSigma[1, # ] == # + FromDigits[Reverse[IntegerDigits[ # ]]] &]
CROSSREFS
KEYWORD
base,nonn
AUTHOR
Joseph L. Pe, Apr 11 2002
STATUS
approved