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 A199168 #18 Jan 09 2025 19:43:47 %S A199168 0,10,102,120,201,210,1023,1032,1203,1230,1302,1320,2013,2031,2103, %T A199168 2130,2301,2310,3012,3021,3102,3120,3201,3210,10234,10243,10324,10342, %U A199168 10423,10432,12034,12043,12304,12340,12403,12430,13024,13042,13204,13240,13402,13420 %N A199168 Numbers whose digits are a permutation of (0,...,m) for some m. %C A199168 2013 is the fourth odd term in this sequence: Up to and including the 5 digit terms, odd terms must end in 1 or 3. %C A199168 Due to the fact that 0 is not allowed as initial digit, this sequence is quite different from A030299, the analog with digits (1,...,m) instead of (0,...,m). %H A199168 Robert Israel, <a href="/A199168/b199168.txt">Table of n, a(n) for n = 1..10000</a> %p A199168 f:= proc(n) map(L -> add(L[i]*10^(n-i),i=1..n), select(L -> L[1] <> 0, combinat:-permute([$0..n-1]))) end proc: %p A199168 f(1):= [0]: %p A199168 seq(op(f(n)),n=1..5); # _Robert Israel_, Jan 09 2025 %o A199168 (PARI) n_digit_terms(n)={my(a=[],p=vector(n,i,10^(n-i))~);for(i=(n-1)!,n!-(n>1),a=concat(a,numtoperm(n,i)%n*p));vecsort(a)} \\ - _M. F. Hasler_, Jan 08 2013 %Y A199168 Cf. A187796 (subset of primes), A203569 (also a subset), A030299 (permutations of 1..m) and references therein. %Y A199168 Pandigital numbers A050278 are also a subset. %Y A199168 Cf. A297062. %K A199168 nonn,base,easy,fini %O A199168 1,2 %A A199168 _M. F. Hasler_, Jan 08 2013