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!)
A111389 Numbers n such that p(3n) is prime, where p(n) is the number of partitions of n. 14

%I #10 Aug 11 2019 05:26:36

%S 1,2,12,44,56,62,72,122,139,166,175,182,245,251,275,362,432,526,712,

%T 831,834,836,856,909,957,1009,1056,1114,1554,2266,2486,2816,3967,4340,

%U 5416,6092,6837,6959,7215,7255,7439,7734,9655,10200,11080,11324,11361,12819

%N Numbers n such that p(3n) is prime, where p(n) is the number of partitions of n.

%H Max Alekseyev, <a href="/A111389/b111389.txt">Table of n, a(n) for n = 1..1669</a>

%F Elements of A046063 which are == 0 (mod 3) divided by 3

%e If n=72 then p(3n) = 15285151248481 (prime).

%t Select[ Range[13370], PrimeQ[ PartitionsP[3# ]] &] (* _Robert G. Wilson v_ *)

%o (PARI) is(n)=isprime(numbpart(3*n)) \\ _Charles R Greathouse IV_, Feb 17 2017

%Y Cf. A000041, A046063, A114165, A111389, A111045, A114166, A111036, A114167, A114168, A114169, A114170.

%K nonn

%O 1,2

%A _Parthasarathy Nambi_, Nov 09 2005

%E a(8)-a(48) from _Robert G. Wilson v_, Nov 11 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 19 18:58 EDT 2024. Contains 371798 sequences. (Running on oeis4.)