A361900 - OEIS

The OEIS is supported by the many generous donors to the OEIS Foundation.

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

Other ways to Give

A361900

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

600, 810, 1074, 7974, 22290, 43086

(list; graph; refs; listen; history; text; internal format)

OFFSET

1,1

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.

LINKS

Table of n, a(n) for n=1..6.

MATHEMATICA

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

CROSSREFS

Cf. A000215, A229852, A351332, A361898, A361899.

Sequence in context: A362324 A172244 A090222 * A216058 A157918 A092183

Adjacent sequences: A361897 A361898 A361899 * A361901 A361902 A361903

KEYWORD

nonn,more

AUTHOR

Arkadiusz Wesolowski, Mar 28 2023

STATUS

approved