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.

A332535 Numbers that are not of the form p + 2^(2^k) + 2^q with p, q primes and k >= 0.

Original entry on oeis.org

1, 2, 3, 4, 5, 6, 7, 16, 18, 20, 24, 28, 30, 32, 34, 40, 42, 44, 46, 48, 52, 54, 56, 58, 60, 62, 64, 66, 68, 70, 72, 74, 76, 78, 80, 82, 84, 86, 88, 90, 92, 94, 96, 98, 100, 102, 104, 106, 108, 110, 112, 114, 116, 118, 120, 122, 124, 126, 128, 130, 136, 138
Offset: 1

Views

Author

N. J. A. Sloane, Feb 15 2020

Keywords

Crossrefs

Programs

  • Maple
    q:= proc(n) local k, i;
          for k from 0 while 2^(2^k)Alois P. Heinz, Feb 15 2020
  • Mathematica
    q[n_] := Module[{k, i}, For[k = 0 , 2^(2^k) < n, k++, For[i = 1, 2^(2^k) + 2^Prime[i] < n, i++, If[PrimeQ[n - 2^(2^k) - 2^Prime[i]], Return[False]]] ]; True];
    Select[Range[200], q] (* Jean-François Alcover, Nov 27 2020, after Alois P. Heinz *)