|
Search: id:A091080
|
|
|
| A091080 |
|
Numbers n which when converted to base 6, 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
|
| |
|
|
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) = 980 because: 980 in base 6 is 4312; 4312 reversed is 2134; 2134 converted back to base 10 is 490 and 980 mod 490 = 0.
|
|
CROSSREFS
|
Cf. A091077 (same in base 3) A091078 (base 4) A091079 (base 5) A091081 (base 7) A091082 (base 8) A091083 (base 9) A031877 (base 10).
Sequence in context: A077380 A063052 A108904 this_sequence A109120 A128483 A056937
Adjacent sequences: A091077 A091078 A091079 this_sequence A091081 A091082 A091083
|
|
KEYWORD
|
base,nonn
|
|
AUTHOR
|
Chuck Seggelin (barkeep(AT)plastereddragon.com), Dec 18 2003
|
|
|
Search completed in 0.002 seconds
|
