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.

A066286 For even n>=4, let f(n)=A066285(n/2) be the minimal difference between primes p and q whose sum is n. This sequence contains the successive maxima of f.

Original entry on oeis.org

0, 2, 6, 18, 30, 36, 42, 54, 66, 78, 84, 90, 96, 150, 174, 186, 234, 240, 270, 276, 336, 366, 420, 456, 600, 666, 738, 786, 906, 1050, 1242, 1440, 1620, 1692, 2172, 2562, 2610, 3030, 3180, 3234, 3444, 3588, 3666, 3702, 4020, 4128, 4170, 4224, 4434, 4704, 5508, 5568, 6678, 6858, 8790, 8976, 10782
Offset: 0

Views

Author

Dean Hickerson, Dec 12 2001

Keywords

Comments

All terms appear to be divisible by 6, except for the first two.

Crossrefs

The corresponding values of n are in A065978.

Programs

  • Mathematica
    f[n_] := For[p=n/2, True, p--, If[PrimeQ[p]&&PrimeQ[n-p], Return[n-2p]]]; For[n=4; max=-1, True, n+=2, If[f[n]>max, Print[max=f[n]]]]

Extensions

a(51)-a(55) from Gilmar Rodriguez (Gilmar.Rodriguez(AT)nwfwmd.state.fl.us), Jun 16 2005
a(56) from Robert G. Wilson v, Jun 27 2005