cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A091082 Numbers n which when converted to base 8, 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.

This page as a plain text file.
%I A091082 #6 Jun 08 2025 16:15:42
%S A091082 42,378,2625,2730,3066,3402,3969,21546,23625,24570,27594,32193,170625,
%T A091082 172074,174762,191625,193914,196602,221130,257985,1346625,1376298,
%U A091082 1400490,1535625,1548666,1572858,1769418,2064321,10754625,10922625,11010090,11031594,11184810
%N A091082 Numbers n which when converted to base 8, 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.
%C A091082 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.
%H A091082 C. Seggelin, <a href="http://www.plastereddragon.com/maths/asortdiv.htm">Numbers Divisible by Digit Permutations</a>. [Broken link]
%e A091082 a(1) = 42 because: 42 in base 8 is 52; 52 reversed is 25; 25 converted back to base 10 is 21 and 42 mod 21 = 0.
%o A091082 (PARI) /* See A091077 and use PARI script with b=8 */
%Y A091082 Cf. A091077 (same in base 3), A091078 (base 4), A091079 (base 5), A091080 (base 6), A091081 (base 7), A091083 (base 9), A031877 (base 10).
%K A091082 base,nonn
%O A091082 1,1
%A A091082 _Chuck Seggelin_, Dec 18 2003
%E A091082 More terms from _Michel Marcus_, Oct 10 2014