The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
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!)
A088292 Smallest prime in which the digit string can be partitioned in n+1 parts (0 parts allowed) such that the sum of the first n parts = the (n+1)th one. 3

%I #4 Dec 05 2013 19:56:34

%S 11,101,1427,10067,100517,1000427,10000247,100001147,1000000427,

%T 10000001057,100000000427,1000000002227,10000000002227,

%U 100000000000067,1000000000011227,10000000000002137,100000000000000337

%N Smallest prime in which the digit string can be partitioned in n+1 parts (0 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.

%Y Cf. A088291, A088293.

%K base,nonn

%O 0,1

%A _Amarnath Murthy_, Sep 30 2003

%E More terms from _David Wasserman_, Aug 04 2005

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 May 27 20:38 EDT 2024. Contains 372882 sequences. (Running on oeis4.)