OFFSET
1,1
COMMENTS
Solutions to gcd(k, reverse(k)) = 1,3,9 (lower powers of 3) are trivial (see A072005).
LINKS
Vincenzo Librandi, Table of n, a(n) for n = 1..1030
EXAMPLE
2889 = 107*3*3*3, 9889 = 3*3*3*3*2*61.
MATHEMATICA
Select[Range[10^4], GCD[#, FromDigits[Reverse[IntegerDigits[#]]]] == 27 &] (* Vincenzo Librandi, Jul 11 2018 *)
PROG
(PARI) isok(n) = gcd(n, fromdigits(Vecrev(digits(n)))) == 27; \\ Michel Marcus, Jul 11 2018
(Magma) [n: n in [1..10^4] | Gcd(n, Seqint(Reverse(Intseq(n)))) eq 27]; // Vincenzo Librandi, Jul 11 2018
CROSSREFS
KEYWORD
nonn,base
AUTHOR
Labos Elemer, Jun 05 2002
STATUS
approved