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 A284063 #19 Sep 08 2022 08:46:19 %S A284063 2,22,23,24,25,26,27,28,29,32,42,52,62,72,82,92,222,223,224,225,226, %T A284063 227,228,229,232,233,234,235,236,237,238,239,242,243,244,245,246,247, %U A284063 248,249,252,253,254,255,256,257,258,259,262,263,264,265,266,267,268 %N A284063 Numbers whose smallest decimal digit is 2. %C A284063 Numbers n such that A054054(n) = 2. %C A284063 Prime terms are in A106102. %t A284063 Select[Range[300], Min[IntegerDigits[#]] == 2 &] (* _Alonso del Arte_, Mar 19 2017 *) %o A284063 (Magma) [n: n in [1..100000] | Minimum(Setseq(Set(Sort(&cat[Intseq(n)])))) eq 2] %o A284063 (PARI) isok(n) = vecmin(digits(n)) == 2; \\ _Michel Marcus_, Mar 25 2017 %o A284063 (Python) %o A284063 def ok(n): return '2' == min(str(n)) %o A284063 print([m for m in range(269) if ok(m)]) # _Michael S. Branicky_, Feb 22 2021 %Y A284063 Cf. Sequences of numbers whose smallest decimal digit is k (for k = 0..9): A011540 (k = 0), A284062 (k = 1), this sequence (k = 2), A284064 (k = 3), A284065 (k = 4), A284066 (k = 5), A284067 (k = 6), A284068 (k = 7), A284069 (k = 8), A002283 (k = 9). %K A284063 nonn,base %O A284063 1,1 %A A284063 _Jaroslav Krizek_, Mar 19 2017