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.

A224030 a(n) = |{0

Original entry on oeis.org

0, 1, 0, 0, 2, 2, 1, 2, 2, 2, 2, 1, 2, 1, 1, 1, 1, 2, 2, 2, 2, 3, 1, 2, 1, 1, 2, 4, 3, 4, 2, 1, 2, 2, 2, 1, 1, 2, 3, 2, 2, 4, 3, 3, 5, 4, 3, 3, 1, 4, 3, 2, 2, 2, 3, 2, 1, 3, 3, 4, 3, 7, 2, 5, 2, 3, 5, 5, 5, 4, 3, 2, 3, 2, 3, 5, 2, 2, 4, 5, 4, 4, 2, 4, 9, 4, 6, 7, 5, 3, 3, 4, 3, 3, 9, 5, 3, 3, 3, 5
Offset: 1

Views

Author

Zhi-Wei Sun, Apr 15 2013

Keywords

Comments

Conjecture: a(n)>0 for all n>4.
This has been verified for n up to 10^8.
We also conjecture that for any integer n>1 there is an integer 0

Examples

			a(7) = 1 since 2*7+5 = 19 and 2*7^3+5^3 = 811 are both prime.
a(57) = 1 since 2*57+23 = 137 and 2*57^3+23^3 = 382553 are both prime.
		

Crossrefs

Programs

  • Mathematica
    a[n_]:=a[n]=Sum[If[PrimeQ[2n+k]==True&&PrimeQ[2n^3+k^3]==True,1,0],{k,1,n-1}]
    Table[a[n],{n,1,100}]