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 A277965 #28 Mar 01 2019 10:36:39 %S A277965 3,13,23,30,31,32,33,103,113,123,130,131,132,133,203,213,223,230,231, %T A277965 232,233,300,301,302,303,310,311,312,313,320,321,322,323,330,331,332, %U A277965 333,1003,1013,1023,1030,1031,1032,1033,1103,1113,1123,1130,1131,1132 %N A277965 Numbers whose largest decimal digit is 3. %C A277965 Number of terms less than 10^n is 4^n - 3^n. - _Chai Wah Wu_, Nov 06 2016 %H A277965 Alois P. Heinz, <a href="/A277965/b277965.txt">Table of n, a(n) for n = 1..10000</a> (first 1000 terms from Colin Barker) %t A277965 A277965Q = Max[IntegerDigits[#]] == 3 &; Select[Range[1200], A277965Q] (* _JungHwan Min_, Nov 06 2016 *) %o A277965 (PARI) L=List(); for(n=1, 10000, if(vecmax(digits(n))==3, listput(L, n))); Vec(L) %o A277965 (GAP) Filtered([1..450],n->Maximum(ListOfDigits(n))=3); # _Muniru A Asiru_, Mar 01 2019 %Y A277965 Cf. A007088, A277964, A277966. %Y A277965 Cf. A005061 (4^n - 3^n). %Y A277965 Cf. A106099 (subsequence of primes). %K A277965 nonn,base %O A277965 1,1 %A A277965 _Colin Barker_, Nov 06 2016