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.
%I A362506 #10 Apr 24 2023 13:09:48
%S A362506 0,1,2,3,1,4,5,6,2,7,8,9,3,10,1,11,12,13,4,14,15,12,16,5,17,18,19,6,
%T A362506 20,13,21,2,22,23,7,14,24,25,26,8,27,23,15,28,29,9,30,31,16,3,10,24,
%U A362506 10,32,33,10,1,34,17,11,35,36,25,12,37,38,12,18,34,12,13
%N A362506 a(n) is the least x >= 0 such that A362505(n) = x * y for some y with the same set of decimal digits as x.
%H A362506 Rémy Sigrist, <a href="/A362506/b362506.txt">Table of n, a(n) for n = 1..10000</a>
%H A362506 Rémy Sigrist, <a href="/A362506/a362506.png">Scatterplot of the first 100000 terms</a>
%e A362506 The first terms, alongside the corresponding y and A362505(n), are:
%e A362506 n a(n) y A362505(n)
%e A362506 -- ---- --- ----------
%e A362506 1 0 0 0
%e A362506 2 1 1 1
%e A362506 3 2 2 4
%e A362506 4 3 3 9
%e A362506 5 1 11 11
%e A362506 6 4 4 16
%e A362506 7 5 5 25
%e A362506 8 6 6 36
%e A362506 9 2 22 44
%e A362506 10 7 7 49
%e A362506 11 8 8 64
%e A362506 12 9 9 81
%e A362506 13 3 33 99
%e A362506 14 10 10 100
%e A362506 15 1 111 111
%o A362506 (PARI) { print1(0); for (k = 1, 1469, fordiv (k, x, if (Set(digits(x)) == Set(digits(k/x)), print1 (", "x); break))) }
%o A362506 (Python)
%o A362506 from sympy import divisors
%o A362506 from itertools import count
%o A362506 def agen(): # generator of terms
%o A362506 yield 0
%o A362506 for n in count(1):
%o A362506 for x in divisors(n):
%o A362506 if set(str(x)) == set(str(n//x)):
%o A362506 yield x
%o A362506 break
%o A362506 print(list(islice(agen(), 71))) # _Michael S. Branicky_, Apr 23 2023
%Y A362506 Cf. A362505.
%K A362506 nonn,base
%O A362506 1,3
%A A362506 _Rémy Sigrist_, Apr 23 2023