cp's OEIS Frontend

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.

A106769 Primes with digit sum = 34.

This page as a plain text file.
%I A106769 #13 Sep 08 2022 08:45:18
%S A106769 17989,18979,19699,25999,27799,27997,28789,28879,29599,29959,35899,
%T A106769 36979,36997,37699,37879,37897,37987,38959,38977,39499,39679,39769,
%U A106769 39877,45979,47599,47779,47797,47869,47977,48589,48679,48787,48859
%N A106769 Primes with digit sum = 34.
%H A106769 Robert Israel, <a href="/A106769/b106769.txt">Table of n, a(n) for n = 1..10000</a>
%p A106769 dmax:= 6; # to get all entries with at most dmax digits
%p A106769 for s from 0 to 9 do S[1,s]:= {s} od:
%p A106769 for s from 10 to 34 do S[1,s]:= {} od:
%p A106769 for d from 2 to dmax-1 do
%p A106769   for s from 0 to 34 do
%p A106769      S[d,s]:= `union`(seq(map(t-> 10*t+x, S[d-1,s-x]),x=0 .. min(s,9)))
%p A106769   od
%p A106769 od:
%p A106769 S[dmax,34]:= `union`(seq(map(t->10*t+x, S[dmax-1,34-x]),x=0..9)):
%p A106769 A106769:= select(isprime,S[dmax,34]); # _Robert Israel_, Jun 03 2014
%t A106769 Select[Prime[Range[50000]], Total[IntegerDigits[#]]==34 &] (* _Vincenzo Librandi_, Jul 08 2014 *)
%o A106769 (Magma) [p: p in PrimesUpTo(50000) | &+Intseq(p) eq 34]; // _Vincenzo Librandi_, Jul 08 2014
%o A106769 (PARI) select(x->sumdigits(x)==34, primes(5000)) \\ _Michel Marcus_, Jul 08 2014
%Y A106769 Cf. similar sequences listed in A244918.
%K A106769 nonn,base
%O A106769 1,1
%A A106769 _Zak Seidov_, May 16 2005