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!)
A110456 Largest prime obtained by concatenation of parts of a distinct partition of n. 0 if no such number exist. 0

%I #5 Dec 05 2013 19:57:03

%S 0,2,3,31,41,0,421,521,0,4231,5231,0,7321,8231,0,64231,74231,0,94321,

%T 431021,0,754123,854213,0,5431021,6421013,0,8431021,9431021,0,

%U 65412103,75411023,0,95421103,96412103,0,643110211,765324101

%N Largest prime obtained by concatenation of parts of a distinct partition of n. 0 if no such number exist.

%C Conjecture a(n) = 0 only for n = 1, or n == 0 (mod 3), n is > 3. Subsidiary sequence (hard): Number of primes generated by concatenation of distinct partitions of n.

%e Distinct partitions of 10 are 10,(9,1), (8,2), (7,3),...(7,2,1),(6,3,1),(5,3,2),...(4,3,2,1), etc. (4231 is the largest number obtained as a concatenation of (4,2,3,1).

%e a(10)=4231.

%K base,nonn

%O 1,2

%A _Amarnath Murthy_, Aug 04 2005

%E Corrected and extended by _R. J. Mathar_, Feb 08 2008

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 24 16:56 EDT 2024. Contains 371962 sequences. (Running on oeis4.)