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 A256825 #7 Apr 25 2016 11:59:32
%S A256825 1,10,21,31,41,51,61,71,81,91,210,310,321,410,421,431,510,521,531,541,
%T A256825 610,621,631,641,651,710,721,731,741,751,761,810,821,831,841,851,861,
%U A256825 871,910,921,931,941,951,961,971,981,3210,4210,4310,4321,5210,5310,5321
%N A256825 Numbers with digits in strictly decreasing order containing digit 1.
%C A256825 a(n) = possible values of A256824(m) in increasing order where A256824(m) = reverse concatenation of distinct digits of all divisors of m in base 10.
%C A256825 There are precisely 512 terms. Maximal term is 9876543210.
%C A256825 Subsequence of A009995 (numbers with digits in strictly decreasing order).
%C A256825 See A256826 - the smallest number k such that A256824(k) = a(n).
%H A256825 Jaroslav Krizek, <a href="/A256825/b256825.txt">Table of n, a(n) for n = 1..512 (complete list)</a>
%e A256825 21 is in sequence because there are numbers m such that A256824(m) = 21 (for m = 2, 22, 121, 211, 2111, ...).
%o A256825 (Excel) [Row n = 1 … 1023; Column A: A(n) = A009995(n); Column B: B(n) = =IF(FIND("1";A(n);1)>0;A(n)); Arrangement of column B]
%o A256825 (PARI) lista(nn) = for (n=1, nn, if ((d = digits(n)) && ((sd=vecsort(d,,8))==Vecrev(d)) && vecsearch(sd, 1), print1(n, ", "))); \\ _Michel Marcus_, Apr 11 2015
%Y A256825 Cf. A009995, A095050, A243534, A256824, A256826.
%K A256825 nonn,base,fini,full
%O A256825 1,2
%A A256825 _Jaroslav Krizek_, Apr 10 2015