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.
%I A361900 #12 Apr 22 2023 19:30:10 %S A361900 600,810,1074,7974,22290,43086 %N A361900 Numbers k such that 3*153479820268467961^2*2^k + 1 is prime. %C A361900 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. %t A361900 Select[Range[2, 10^4, 2], PrimeQ[3*153479820268467961^2*2^# + 1] &] %Y A361900 Cf. A000215, A229852, A351332, A361898, A361899. %K A361900 nonn,more %O A361900 1,1 %A A361900 _Arkadiusz Wesolowski_, Mar 28 2023