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 A156756 #17 Jul 13 2025 13:33:50
%S A156756 2,3,5,7,23,29,41,43,47,61,67,83,89,113,131,137,139,151,157,173,179,
%T A156756 191,193,197,199,223,227,229,241,263,269,281,283,311,313,317,331,337,
%U A156756 353,359,373,379,397,401,409,421,443,449,461,463,467,487,557,571,577,593
%N A156756 Primes not containing exactly two odd digits.
%C A156756 Odd digits are 1, 3, 5, 7 or 9.
%H A156756 Indranil Ghosh, <a href="/A156756/b156756.txt">Table of n, a(n) for n = 1..50000</a>
%F A156756 a(n) ~ n log n. On the Riemann hypothesis, a(n) = ali(n) + O(n^k log n) where ali is the inverse logarithmic integral and k = log 5/log 10 = 0.69897.... - _Charles R Greathouse IV_, Apr 08 2016
%t A156756 checkQ[n_] := Module[{d = IntegerDigits[n]}, Length[Select[d, OddQ]] != 2]; Select[Prime[Range[200]], checkQ] (* _T. D. Noe_, Jun 06 2012 *)
%o A156756 (PARI) is(n)=#select(d->d%2,digits(n))!=2 && isprime(n) \\ _Charles R Greathouse IV_, Apr 08 2016
%Y A156756 Cf. A104638, A119450.
%K A156756 nonn,base
%O A156756 1,1
%A A156756 _Juri-Stepan Gerasimov_, Feb 15 2009
%E A156756 183 replaced by 283 - _R. J. Mathar_, Feb 20 2009
%E A156756 Definition clarified by _Jonathan Sondow_, Jun 06 2012