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.

A088291 Primes in which the digit string can be partitioned into three parts such that the sum of the first two is equal to the third, and the second part is nonzero.

This page as a plain text file.
%I A088291 #14 Mar 06 2021 15:13:56
%S A088291 167,257,347,617,5813,7411,8311,8513,9413,9817,10111,10313,11213,
%T A088291 11617,12113,12517,12829,13417,13619,14243,14519,14923,15217,15823,
%U A088291 15859,16061,16319,17623,18119,18523,19423,19697,20323,20929,21517,22123
%N A088291 Primes in which the digit string can be partitioned into three parts such that the sum of the first two is equal to the third, and the second part is nonzero.
%C A088291 Note that some terms have 2 "solutions", e.g., 11213 => 1 + 12 = 11 + 2 = 13. - _Zak Seidov_, Apr 30 2013
%H A088291 Zak Seidov, <a href="/A088291/b088291.txt">Table of n, a(n) for n = 1..1000</a>
%e A088291 12517 is a member as it can be digit partitioned in to 12,5 and 17, 12+5 =17.
%e A088291 3407 is not a member as the partitions 3, 4, 07 is not permitted though 3 + 4 = 7.
%o A088291 (PARI) is(n)=my(d=digits(n)); for(i=1,#d-2, for(j=i+1,#d-1, if(digits(fromdigits(d[1..i])+fromdigits(d[i+1..j]))==d[j+1..#d] && d[i+1], return(isprime(n))))); 0
%o A088291 select(is,primes(10^4)) \\ _Charles R Greathouse IV_, Sep 21 2015
%Y A088291 See A067860 for another version.~
%K A088291 base,nonn
%O A088291 1,1
%A A088291 _Amarnath Murthy_, Sep 30 2003
%E A088291 More terms from _David Wasserman_, Aug 04 2005
%E A088291 Definition clarified by _N. J. A. Sloane_, Mar 06 2021 at the suggestion of _Tanya Khovanova_