|
Search: id:A091079
|
|
|
| A091079 |
|
Numbers n which when converted to base 5, reversed, and converted back to base 10 yield a number m such that n mod m = 0. Cases which are trivial or result in digit loss are excluded. |
|
+0
7
|
|
| 16, 96, 416, 496, 576, 2016, 2496, 2976, 10016, 10416, 12096, 12496, 14976, 50016, 52416, 60096, 62496, 74976
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
COMMENT
|
Trivial cases are those numbers which upon conversion result in a number which is palindromic (m = reverse(m)), or a palindrome plus trailing zeros such that m = reverse(m)*10^z where z=number of lost zeros. Nontrivial digit loss occurs when a converted number has trailing zeros that drop off when the number is reversed.
|
|
LINKS
|
C. Seggelin, Numbers Divisible by Digit Permutations.
|
|
EXAMPLE
|
a(1) = 16 because: 16 in base 5 is 31; 31 reversed is 13; 13 converted back to base 10 is 8 and 16 mod 8 = 0.
|
|
CROSSREFS
|
Cf. A091077 (same in base 3) A091078 (base 4) A091080 (base 6) A091081 (base 7) A091082 (base 8) A091083 (base 9) A031877 (base 10).
Adjacent sequences: A091076 A091077 A091078 this_sequence A091080 A091081 A091082
Sequence in context: A006637 A014344 A100313 this_sequence A014352 A083295 A044267
|
|
KEYWORD
|
base,nonn
|
|
AUTHOR
|
Chuck Seggelin (barkeep(AT)plastereddragon.com), Dec 18 2003
|
|
|
Search completed in 0.002 seconds
|
