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 A256826 #9 Jul 25 2025 20:29:13
%S A256826 1,101,2,3,41,5,61,7,181,19,202,103,23,401,4,43,505,25,15,451,601,122,
%T A256826 163,461,1661,107,127,37,47,157,67,1801,281,83,1481,5581,1861,187,109,
%U A256826 29,9,149,59,619,79,89,2003,404,403,123,10,503,115,4051,12451,453
%N A256826 a(n) = the smallest number k such that A256824(k) = A256825(n).
%C A256826 A256824(n) = reverse concatenation of distinct digits of all divisors of n in base 10, A256825(n) = possible values of A256824(m) in increasing order.
%C A256826 Finite sequence with 512 terms. Maximal term is a(185) = 88511.
%H A256826 Jaroslav Krizek, <a href="/A256826/b256826.txt">Table of n, a(n) for n = 1..512 (complete list)</a>
%e A256826 a(11) = 202 because 202 is the smallest number k such that reverse concatenation of distinct digits of all divisors of k (i.e. 1, 2, 101, 202) in base 10 = A256824(k) = A256824(202) = A256825(11) = 210.
%o A256826 (Magma) A256826:=func<n | exists(r){k: k in [1..100000] |
%o A256826 Seqint(Setseq(Set(Sort(&cat[Intseq(d): d in Divisors(k)])))) eq n} select r else 0>; [A256826(n): n in[A256825(n)]];
%Y A256826 Cf. A009995, A095050, A243534, A256824, A256825.
%K A256826 nonn,base,fini,full
%O A256826 1,2
%A A256826 _Jaroslav Krizek_, Apr 13 2015