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 A132192 #7 Jul 17 2021 11:21:56
%S A132192 1,1,2,6,40,17,4,6,47,48,334,99,585,19,350,1201,197,3577,2020,870,
%T A132192 2322,4488,6150,12397,7817
%N A132192 Least number k such that 4*(k*(2^p-1))^2 + 1 is prime where 2^p-1 is a Mersenne prime (p in A000043).
%e A132192 a(1) = 1 since 3 = 2^A000043(1) - 1 and 4*(1*3)^2 + 1 = 37 is prime.
%t A132192 f[n_] := Module[{k = 1}, While[!PrimeQ[4*(k*n)^2 + 1], k++]; k]; f /@ (2^MersennePrimeExponent[Range[15]] - 1)(* _Amiram Eldar_, Jul 17 2021 *)
%Y A132192 Cf. A000043, A000668.
%K A132192 nonn,more
%O A132192 1,3
%A A132192 _Pierre CAMI_, Nov 05 2007
%E A132192 Data corrected and a(23)-a(25) added by _Amiram Eldar_, Jul 17 2021