|
Search: id:A020485
|
|
|
| A020485 |
|
Least positive palindromic multiple of n, or 0 if none exists. |
|
+0
3
|
|
| 1, 2, 3, 4, 5, 6, 7, 8, 9, 0, 11, 252, 494, 252, 525, 272, 272, 252, 171, 0, 252, 22, 161, 696, 525, 494, 999, 252, 232, 0, 434, 2112, 33, 272, 525, 252, 111, 494, 585, 0, 656, 252, 989, 44, 585, 414, 141, 2112, 343, 0, 969, 676, 212, 27972, 55, 616, 171, 232, 767, 0, 26962
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
COMMENT
|
Existence of palindromic multiples is a corollary of the theorem: An arithmetic progression given by an integer a(0) and by a positive common difference d contains infinitely many palindromic numbers unless both of these numbers are multiples of ten - M. Harminc (harminc(AT)duro.science.upjs.sk), Jul 14 2000
|
|
REFERENCES
|
M. Harminc and R. Sotak, Palindromic numbers in arithmetic progressions, Fibonacci Quarterly Journal, Jun-Jul (1998), pp. 259-262.
|
|
CROSSREFS
|
Sequence in context: A080434 A062567 A069554 this_sequence A083116 A084044 A048379
Adjacent sequences: A020482 A020483 A020484 this_sequence A020486 A020487 A020488
|
|
KEYWORD
|
nonn,base
|
|
AUTHOR
|
David W. Wilson (davidwwilson(AT)comcast.net)
|
|
|
Search completed in 0.002 seconds
|
