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 A062653 #19 Sep 08 2022 08:45:03
%S A062653 2,23,29,127,211,223,227,229,233,239,241,251,254,257,263,269,271,277,
%T A062653 281,283,293,421,422,482,502,521,523,526,529,542,562,727,821,823,827,
%U A062653 829,842,929,1021,1042,1123,1129,1201,1213,1217,1223,1229,1231,1237
%N A062653 Every divisor (except 1) contains the digit 2.
%H A062653 Amiram Eldar, <a href="/A062653/b062653.txt">Table of n, a(n) for n = 1..10000</a>
%e A062653 254 has divisors 1, 2, 127 and 254, all of which contain the digit 2.
%t A062653 fQ[n_, dgt_] := Union[ MemberQ[#, dgt] & /@ IntegerDigits@ Rest@ Divisors@ n][[1]]; Select[ Range[2, 1300], fQ[#, 2] &] (* _Robert G. Wilson v_, Jun 11 2014 *)
%o A062653 (Magma) [k:k in [2..1300]| forall{d:d in Set(Divisors(k)) diff {1}| 2 in Intseq(d)}]; // _Marius A. Burtea_, Nov 07 2019
%o A062653 (PARI) has2(n)=if(n==1, return(1)); !!setsearch(Set(digits(n)),2)
%o A062653 is(n)=fordiv(n,d, if(!has2(d), return(0))); 1 \\ _Charles R Greathouse IV_, Jan 24 2020
%Y A062653 Cf. A062664, A062667, A062668, A062669, A062670, A062671, A062672, A062673, A062674, A062675, A062676, A062677, A062678, A062679, A062680.
%K A062653 base,easy,nonn
%O A062653 1,1
%A A062653 _Erich Friedman_, Jul 04 2001
%E A062653 Offset corrected by _Amiram Eldar_, Nov 07 2019