This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A111389 #10 Aug 11 2019 05:26:36 %S A111389 1,2,12,44,56,62,72,122,139,166,175,182,245,251,275,362,432,526,712, %T A111389 831,834,836,856,909,957,1009,1056,1114,1554,2266,2486,2816,3967,4340, %U A111389 5416,6092,6837,6959,7215,7255,7439,7734,9655,10200,11080,11324,11361,12819 %N A111389 Numbers n such that p(3n) is prime, where p(n) is the number of partitions of n. %H A111389 Max Alekseyev, <a href="/A111389/b111389.txt">Table of n, a(n) for n = 1..1669</a> %F A111389 Elements of A046063 which are == 0 (mod 3) divided by 3 %e A111389 If n=72 then p(3n) = 15285151248481 (prime). %t A111389 Select[ Range[13370], PrimeQ[ PartitionsP[3# ]] &] (* _Robert G. Wilson v_ *) %o A111389 (PARI) is(n)=isprime(numbpart(3*n)) \\ _Charles R Greathouse IV_, Feb 17 2017 %Y A111389 Cf. A000041, A046063, A114165, A111389, A111045, A114166, A111036, A114167, A114168, A114169, A114170. %K A111389 nonn %O A111389 1,2 %A A111389 _Parthasarathy Nambi_, Nov 09 2005 %E A111389 a(8)-a(48) from _Robert G. Wilson v_, Nov 11 2005