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!)
A088295 Smallest prime in which the digit string can be partitioned in n+1 parts such that the product of the first n parts = the (n+1)th one. 0

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

%S 11,199,3319,11177,111919,1111339,11133119,111111199,1111111919,

%T 11111113319,1111111139381,1111111111177,11111111113139,

%U 111111111113113,1111111111113319,11111111311111319,111111111311111113

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

%e a(3) = 3319 because it can be partitioned as 3, 3, 1, 9 and 3*3*1 = 9.

%Y Cf. A088291, A088292, A088293, A088294.

%K base,nonn

%O 0,1

%A _Amarnath Murthy_, Sep 30 2003

%E More terms from _David Wasserman_, Aug 08 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 April 25 03:15 EDT 2024. Contains 371964 sequences. (Running on oeis4.)