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 A118703 #9 May 22 2025 04:36:39 %S A118703 7,43,61,151,223,241,313,331,421,1123,1213,1231,1321,2113,2131,2221, %T A118703 2311,3121,4111,11113,11131,11311,12211,21121,21211,22111,111121, %U A118703 111211,112111 %N A118703 Zero-free primes with digit sum equal to 7. %C A118703 There are exactly 29 such primes the largest one being 112111. %t A118703 Select[Prime[Range[11000]],DigitCount[#,10,0]==0&&Total[ IntegerDigits[ #]] == 7&] (* _Harvey P. Dale_, Dec 04 2020 *) %o A118703 (PARI) isok(n) = isprime(n) && (sumdigits(n) == 7) && (vecmin(digits(n)) != 0); \\ _Michel Marcus_, Oct 10 2013 %Y A118703 Cf. A062337, A052221, A119461. %K A118703 base,fini,full,nonn %O A118703 1,1 %A A118703 _Zak Seidov_, May 20 2006