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 A108636 #14 Oct 01 2024 19:12:23
%S A108636 4,6,22,26,46,62,82,86,202,206,226,262,422,446,466,482,622,626,662,
%T A108636 802,842,862,866,886,2026,2042,2062,2066,2206,2246,2402,2426,2446,
%U A108636 2462,2602,2606,2642,2846,2866,4006,4022,4222,4226,4262,4282,4286,4406,4426,4442
%N A108636 Semiprimes with even digits.
%C A108636 Semiprimes with even digits are less numerous than those with odd digits, cf. A091296.
%C A108636 "Semiprimes with even digits are less numerous than those with odd digits" because (base 10): no integer after 10 can end in a 0 without being divisible by 2, 5 and at least one other prime; for a semiprime to end in 2, 4, 6, or 8 it must be divisible by 2 and a prime with almost as many digits as the semiprime (and primes get rarer as they get longer); no semiprime with all even digits after 22 can be a repdigit; and similar constraints. - _Jonathan Vos Post_, Nov 07 2005
%H A108636 Robert Israel, <a href="/A108636/b108636.txt">Table of n, a(n) for n = 1..10000</a>
%p A108636 f:= proc(n) local L,x,i;
%p A108636 L:= convert(n,base,5);
%p A108636 x:= 2*add(L[i]*10^(i-1),i=1..nops(L));
%p A108636 if isprime(x/2) then x else NULL fi
%p A108636 end proc:
%p A108636 map(f, [$1..1000]); # _Robert Israel_, Oct 01 2024
%t A108636 Select[Range[6000], Plus@@Last/@FactorInteger[ # ]==2&&Union[EvenQ/@IntegerDigits[ # ]]=={True}&]
%Y A108636 Intersection of A001358 and A014263.
%Y A108636 Cf. A091296.
%K A108636 nonn,base,look
%O A108636 1,1
%A A108636 _Zak Seidov_, Jun 14 2005