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.

A128688 a(1)=1. For n>1, a(n) is the smallest even number such that every subset of a(1), ..., a(n) adds to a nonprime.

Original entry on oeis.org

1, 8, 24, 86, 90, 780, 5940, 52350, 278460, 40768260, 6847205430, 5027286840810
Offset: 1

Views

Author

T. D. Noe, Mar 20 2007

Keywords

Comments

The first 7 terms are from Rivera's puzzle 84.
The sequences is infinite [Chris Nash]. - N. J. A. Sloane, Jan 20 2017

Crossrefs

Cf. A052349 (no restrictions on even or odd), A128687 (restricted to odd numbers).

Programs

  • Mathematica
    a[1] = 1; a[n_] := a[n] = (s = Subsets[Array[a, n-1], n-1]; c = a[n-1] + 1; While[d = 1; While[!PrimeQ[Total[s[[d]]] + c] && d < Length@s, d++]; d != Length@s || PrimeQ[Total[s[[d]]] + c] || OddQ@c, c++]; c); Array[a, 8] (* Giorgos Kalogeropoulos, Nov 19 2021 *)

Extensions

a(11) from Donovan Johnson, Apr 18 2010
a(12) from Donovan Johnson, Jul 06 2010