login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A088293 Smallest prime in which the digit string can be partitioned into n+1 parts (only nonzero parts allowed) such that the sum of the first n parts = the (n+1)th one. 3

%I #21 Apr 24 2017 10:52:07

%S 11,167,1427,12227,111227,11117213,11111117,1111111411,11111111917,

%T 111111118319,1111111111717,11111111132923,111111111114823,

%U 1111111111113823,11111111111111923,111111111111112319,1111111111111116223,11111111111111121119,111111111111111111523

%N Smallest prime in which the digit string can be partitioned into n+1 parts (only nonzero parts allowed) such that the sum of the first n parts = the (n+1)th one.

%e a(1) = 11, 1 = 1.

%e a(2) = 167, 1+6 = 7

%e a(3) = 1427, 1+4+2 = 7.

%e a(4) = 12227, 1+2+2+2 = 7.

%e a(5) = 111227, 1+1+1+2+2 = 7.

%e a(6) = 11117213, 1+1+1+1+7+2 = 13.

%e a(7) = 11111117, 1+1+1+1+1+1+1 = 7.

%e a(8) = 1111111411, 1+1+1+1+1+1+1+4 = 11.

%Y Cf. A088291, A088292.

%K base,nonn

%O 1,1

%A _Amarnath Murthy_, Sep 30 2003

%E a(6)-a(8) from _Randy L. Ekl_, Jan 08 2017

%E Offset corrected by _Omar E. Pol_, Jan 09 2017

%E a(9)-a(19) from _Giovanni Resta_, Apr 24 2017

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 22 19:22 EDT 2024. Contains 371906 sequences. (Running on oeis4.)