A276255 - OEIS

%I #14 Aug 29 2016 16:27:28

%S 131,394,851,1890,2939,4030,5331,6692,8125,9696,11609,13542,15683,

%T 17904,20177,22618,25209,27872,30579,33298,36027,38830,41897,45034,

%U 48263,51696,55255,58886,62977,67130,71487,75884,80587,85310,90213,95222,100729,106430,112141

%N Sum of first n Honaker primes.

%C A Honaker prime is a prime number prime(k) such that k and prime(k) have the same sum of digits.

%H K. D. Bajpai, <a href="/A276255/b276255.txt">Table of n, a(n) for n = 1..7300</a>

%e The first Honaker prime is 131, so a(1) = 131.

%e The second Honaker prime is 263, so a(2) = 131 + 263 = 394.

%t Accumulate[Select[Prime@Range@3000, Plus @@ IntegerDigits@# == Plus @@ IntegerDigits@PrimePi@# &]] (* Bajpai *)

%t Accumulate[Table[Prime[n] * Boole[Plus@@IntegerDigits[n] == IntegerDigits[Prime[n]]], {n, 1000}] (* _Alonso del Arte_, Aug 25 2016 *)

%o (Perl) use ntheory ":all"; my($s,$i)=(0,0); forprimes { say $s+=$_ if sumdigits($_) == sumdigits(++$i) } 1e7; # _Dana Jacobsen_, Aug 29 2016

%o (PARI) first(n)=my(v=vector(n),i,k,s); forprime(p=2,, if(sumdigits(k++)==sumdigits(p), v[i++] = s+=p); if(i==n, return(v))) \\ _Charles R Greathouse IV_, Aug 29 2016

%Y Cf. A033548.

%K nonn,base

%O 1,1

%A _K. D. Bajpai_, Aug 25 2016