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 A106757 #16 Mar 10 2022 03:21:43
%S A106757 79,97,277,349,367,439,457,547,619,673,691,709,727,853,907,1069,1087,
%T A106757 1249,1429,1447,1483,1609,1627,1663,1753,1861,1933,1951,2239,2293,
%U A106757 2347,2383,2437,2473,2617,2671,2707,2833,2851,3049,3067,3229,3319,3373,3391
%N A106757 Primes with digit sum = 16.
%H A106757 Harvey P. Dale, <a href="/A106757/b106757.txt">Table of n, a(n) for n = 1..1000</a>
%F A106757 Intersection of A000040 (primes) and A235227 (digit sum = 16); also equals { p in A000040 | A007953(p) = 16 }. - _M. F. Hasler_, Mar 09 2022
%t A106757 Reap[Do[If[16==Apply[Plus,IntegerDigits[p=Prime[n]]],Sow[p]],{n,1000}]][[2,1]] (* _Zak Seidov_, Oct 30 2009 *)
%t A106757 Select[Prime[Range[500]],Total[IntegerDigits[#]]==16&] (* _Harvey P. Dale_, Nov 14 2011 *)
%o A106757 (Magma) [p: p in PrimesUpTo(4000) | &+Intseq(p) eq 16]; // _Vincenzo Librandi_, Jul 08 2014
%o A106757 (PARI) select( {is_A106757(n)= sumdigits(n)==16 && isprime(n)}, primes([1, 3333])) \\ _M. F. Hasler_, Mar 09 2022
%Y A106757 Cf. A000040 (primes), A007953 (sum of digits), A235227 (digit sum = 16).
%Y A106757 Cf. A062339 (same for digit sum s = 4), A106756 (s = 14), A106758 (s = 17), and others listed in A244918 (s = 68).
%Y A106757 Subsequence of A062342 (primes whose sum of digits is a multiple of 8) and of A107288 (primes with sum of digits a square).
%K A106757 nonn,base
%O A106757 1,1
%A A106757 _Zak Seidov_, May 16 2005
%E A106757 More terms from _Zak Seidov_, Oct 30 2009