|
Search: id:A091078
|
|
|
| A091078 |
|
Numbers n which when converted to base 4, 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) = 225 because: 225 in base 4 is 3201; 3201 reversed is 1023; 1023 converted back to base 10 is 75 and 225 mod 75 = 0.
|
|
CROSSREFS
|
Cf. A091077 (same in base 3) A091079 (base 5) A091080 (base 6) A091081 (base 7) A091082 (base 8) A091083 (base 9) A031877 (base 10).
Sequence in context: A117246 A027470 A134934 this_sequence A060861 A076395 A105925
Adjacent sequences: A091075 A091076 A091077 this_sequence A091079 A091080 A091081
|
|
KEYWORD
|
base,nonn
|
|
AUTHOR
|
Chuck Seggelin (barkeep(AT)plastereddragon.com), Dec 18 2003
|
|
|
Search completed in 0.002 seconds
|
