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.

A361900 Numbers k such that 3*153479820268467961^2*2^k + 1 is prime.

Original entry on oeis.org

600, 810, 1074, 7974, 22290, 43086
Offset: 1

Views

Author

Arkadiusz Wesolowski, Mar 28 2023

Keywords

Comments

Let p be a prime number of the form 3*153479820268467961^2*2^k + 1 with k > 0, then the multiplicative order of 2 modulo p is not of the form 2^(m+1), m >= 0. Hence, p does not divide any Fermat number F(m) = 2^(2^m) + 1.

Crossrefs

Programs

  • Mathematica
    Select[Range[2, 10^4, 2], PrimeQ[3*153479820268467961^2*2^# + 1] &]