cp's OEIS Frontend

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.

Previous Showing 11-11 of 11 results.

A289193 Number of ways to represent prime(n)^3 as a sum of 3 distinct primes.

Original entry on oeis.org

0, 3, 45, 204, 1735, 3640, 13529, 22271, 58302, 182507, 250688, 613046, 1038538, 1311167, 2081983, 3851401, 6675916, 7887193, 12835857, 17422352, 20067757, 30239982, 39351402, 56657043, 88847952, 110134459, 121855019
Offset: 1

Views

Author

Zak Seidov, Jun 28 2017

Keywords

Comments

From the ternary Goldbach conjecture.

Examples

			a(2)=3: prime(2)=3, and 3^3=27=3+5+19=3+7+17=3+11+13 (3 ways).
		

Crossrefs

Programs

  • Mathematica
    Table[Length@ Select[IntegerPartitions[Prime[n]^3, {3}], And[AllTrue[#, PrimeQ], UnsameQ @@ #] &], {n, 7}] (* Michael De Vlieger, Jun 28 2017 *)
  • PARI
    a(n)=my(t=prime(n)^3,tp,s); forprime(p=t\3, t-4, tp=t-p; forprime(q=tp\2+1, min(tp, p-1), if(isprime(tp-q), s++))); s \\ Charles R Greathouse IV, Jul 02 2017

Formula

a(n) = A125688(A030078(n)).

Extensions

a(11)-a(27) from Charles R Greathouse IV, Jul 02 2017
Previous Showing 11-11 of 11 results.