David A. Corneth, <a href="/A243941/b243941_1.txt">Table of n, a(n) for n = 1..10000</a> (first 1000 terms from Andrew Howroyd)
David A. Corneth, <a href="/A243941/b243941_1.txt">Table of n, a(n) for n = 1..10000</a> (first 1000 terms from Andrew Howroyd)
reviewed
approved
proposed
reviewed
editing
proposed
Andrew Howroyd, David A. Corneth, <a href="/A243941/b243941_1.txt">Table of n, a(n) for n = 1..10000</a> (first 1000</a> terms from Andrew Howroyd)
approved
editing
proposed
approved
editing
proposed
Cf. A243940 (decompositions of n^2 into 4 primes).
proposed
editing
editing
proposed
1, 2, 2, 5, 5, 3, 6, 3, 6, 8, 5, 6, 7, 6, 10, 10, 9, 8, 15, 10, 13, 8, 23, 5, 16, 21, 10, 20, 13, 30, 12, 14, 26, 16, 35, 16, 21, 22, 23, 38, 17, 28, 20, 36, 37, 16, 30, 27, 35, 33, 35, 29, 25, 34, 43, 51, 32, 44, 28, 39, 51, 40, 49, 31, 76, 31, 30, 52, 36, 103
Andrew Howroyd, <a href="/A243941/b243941.txt">Table of n, a(n) for n = 1..1000</a>
(PARI) a(n)={my(m=18*n^2, s=0); forprime(p=5, m/2, if(isprime(m-p) && isprime(p-2) && isprime(m-p+2), s++)); s} \\ Andrew Howroyd, Sep 17 2019
nonn,more
nonn
Terms a(41) and beyond from Andrew Howroyd, Sep 17 2019
approved
editing