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.

A263169 Smallest positive k such that 78557^k + 2^n is prime, or 0 if no such value exists.

Original entry on oeis.org

0, 33, 2, 0, 76
Offset: 0

Views

Author

Arkadiusz Wesolowski, Oct 11 2015

Keywords

Comments

{0, 2, 3} is the set of all noncomposite numbers that belong to this sequence.
The sequence continues: a(5) = ?, a(6) = ?, 87, 12, 0, 0, 3, a(12) = ?.

Crossrefs

Cf. A076336.

Programs

  • Magma
    lst:=[]; for n in [1..4] do if not n mod 6 eq 3 then k:=2; while not IsPrime(78557^k+2^n) do k+:=1; end while; Append(~lst, k); else Append(~lst, 0); end if; end for; [0] cat lst;