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 A276255 #18 Jun 30 2025 04:19:44
%S A276255 131,394,851,1890,2939,4030,5331,6692,8125,9696,11609,13542,15683,
%T A276255 17904,20177,22618,25209,27872,30579,33298,36027,38830,41897,45034,
%U A276255 48263,51696,55255,58886,62977,67130,71487,75884,80587,85310,90213,95222,100729,106430,112141
%N A276255 Sum of first n Honaker primes.
%C A276255 A Honaker prime is a prime number prime(k) such that k and prime(k) have the same sum of digits.
%H A276255 K. D. Bajpai, <a href="/A276255/b276255.txt">Table of n, a(n) for n = 1..7300</a>
%e A276255 The first Honaker prime is 131, so a(1) = 131.
%e A276255 The second Honaker prime is 263, so a(2) = 131 + 263 = 394.
%t A276255 Accumulate[Select[Prime@Range@3000, Plus @@ IntegerDigits@# == Plus @@ IntegerDigits@PrimePi@# &]] (* Bajpai *)
%t A276255 DeleteDuplicates[Accumulate[Table[Prime[n] * Boole[Plus@@IntegerDigits[n] == Plus@@IntegerDigits[Prime[n]]], {n, 1000}]]] (* _Alonso del Arte_, Aug 25 2016 *)
%o A276255 (Perl) use ntheory ":all"; my($s,$i)=(0,0); forprimes { say $s+=$_ if sumdigits($_) == sumdigits(++$i) } 1e7; # _Dana Jacobsen_, Aug 29 2016
%o A276255 (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 A276255 Cf. A033548.
%K A276255 nonn,base
%O A276255 1,1
%A A276255 _K. D. Bajpai_, Aug 25 2016