cp's OEIS Frontend

A277964 Numbers whose largest decimal digit is 2.

%I A277964 #29 Mar 03 2019 03:01:57
%S A277964 2,12,20,21,22,102,112,120,121,122,200,201,202,210,211,212,220,221,
%T A277964 222,1002,1012,1020,1021,1022,1102,1112,1120,1121,1122,1200,1201,1202,
%U A277964 1210,1211,1212,1220,1221,1222,2000,2001,2002,2010,2011,2012,2020,2021,2022
%N A277964 Numbers whose largest decimal digit is 2.
%C A277964 Number of terms less than 10^n is 3^n-2^n, i.e., A001047(n). - _Chai Wah Wu_, Nov 06 2016 [extended by _Felix Fröhlich_, Nov 07 2016]
%C A277964 Numbers n such that A054055(n) = 2. - _Felix Fröhlich_, Nov 07 2016
%H A277964 Alois P. Heinz, <a href="/A277964/b277964.txt">Table of n, a(n) for n = 1..10000</a> (first 1000 terms from Colin Barker)
%p A277964 N:= 6: # to get all terms of at most N digits
%p A277964 R:= 2: B:= {1}: C:= {1,2}:
%p A277964 for  d from 2 to N do B:= map(t -> (10*t,10*t+1),B);
%p A277964 C:= map(t -> (10*t,10*t+1,10*t+2),C);
%p A277964 R:= R, op(sort(convert(C minus B,list)))
%p A277964 od:
%p A277964 R; # _Robert Israel_, Nov 07 2016
%t A277964 A277964Q = Max[IntegerDigits[#]] == 2 &; Select[Range[2000], A277964Q] (* _JungHwan Min_, Nov 06 2016 *)
%o A277964 (PARI) L=List(); for(n=1, 10000, if(vecmax(digits(n))==2, listput(L, n))); Vec(L)
%o A277964 (GAP) Filtered([1..2100],n->Maximum(ListOfDigits(n))=2); # _Muniru A Asiru_, Mar 01 2019
%Y A277964 Cf. A007088, A277965, A277966.
%K A277964 nonn,base
%O A277964 1,1
%A A277964 _Colin Barker_, Nov 06 2016