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 A329168 #21 Sep 08 2022 08:46:24
%S A329168 1,17,4097,7361,85073,658529,3999137,72281281,285143057,628944689,
%T A329168 854112113,1423081169,2561019281,3111576929,4298117633,5921265041,
%U A329168 14224884929,21336998129,34317377233,50723421713,63797137889,144269032049,163834314353,187397322209,212565453281
%N A329168 Numbers m that divide 4^(m + 1) + 1.
%C A329168 Conjecture: For k > 1, k^(m + 1) == -1 (mod m) has an infinite number of positive solutions.
%C A329168 Conjecture: For k > 1, if f(1) = p(1) equals one of the prime factors of k^2 + 1, p(i+1) equals one of the prime factors of k^(f(i)+1) + 1 greater than p(i), f(i+1) = f(i)*p(i+1), then k^(f(i) + 1) == -1 (mod f(i)) for all integers i. (Especially in this sequence, k = 4, so {f(i)} can be 17, 4097, 4298117633, ...) - _Jinyuan Wang_, Nov 16 2019
%o A329168 (Magma) [n + 1: n in [0..5000000] | Modexp(4, n + 2, n + 1) eq n ];
%o A329168 (PARI) isok(m) = Mod(4, m)^(m+1) == -1; \\ _Jinyuan Wang_, Nov 16 2019
%Y A329168 Cf. A055685.
%Y A329168 Solutions to k^(m + 1) + 1 == -1 (mod m): A296369 (k = 2), A328230 (k = 3).
%K A329168 nonn
%O A329168 1,2
%A A329168 _Juri-Stepan Gerasimov_, Nov 06 2019
%E A329168 a(13)-a(25) from _Giovanni Resta_, Nov 08 2019