This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A069554 Smallest k > 0 with gcd(k, rev(k)) = n, where rev(k) is digit reversal of k, or 0 if no such k exists. 11
 1, 2, 3, 4, 5, 6, 7, 8, 9, 0, 11, 48, 1495, 2072, 510, 2192, 1156, 234, 2489, 0, 168, 22, 3358, 840, 5200, 2678, 2889, 4256, 5017, 0, 1178, 21920, 33, 20774, 5075, 216, 1009009009009, 2318, 1677, 0, 1066, 2436, 15523, 44, 540, 20516, 30644, 8400, 18718, 0, 1479, 21788 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 LINKS EXAMPLE a(12) = 48 as gcd(48,84) = 12. PROG (PARI) a(n) = {if (n % 10 == 0, return (0)); k = 1; while (gcd(k, subst(Polrev(digits(k)), x, 10)) != n, k++); k; } \\ Michel Marcus, Sep 14 2013 CROSSREFS Sequence in context: A067079 A080434 A062567 * A020485 A083116 A084044 Adjacent sequences:  A069551 A069552 A069553 * A069555 A069556 A069557 KEYWORD nonn,base,changed AUTHOR Amarnath Murthy, Mar 22 2002 EXTENSIONS Edited by David W. Wilson and Don Reble, Jun 04 2002 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified October 16 13:51 EDT 2019. Contains 328093 sequences. (Running on oeis4.)