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 A332029 #16 Mar 06 2020 22:32:24 %S A332029 0,2,2,1,1,1,1,1,1,0,4,1,1,1,1,0,6,1,1,1,1,0,24,1,1,0,2,0,2,1,1,1,1,0, %T A332029 2,0,2,1,1,0,4,1,1,1,1,0,2,1,1,0,8,0,4,1,1,0,12,0,4,1,1,1,1,0,8,0,3,1, %U A332029 1,0,2,1,1,1,1,0,2,0,38,1,1,0,4,1,1,0,4 %N A332029 a(n) is the least number k > 0 such that n^k - (n mod 2) - 1 is prime, or 0 if no such number exists. %F A332029 For k >= 1, a(2*k+2) = A101264(k), a(2*k-1) = A255707(k). - _Jinyuan Wang_, Feb 07 2020 %F A332029 a(n) = 0 for n in A238204. - _Michel Marcus_, Feb 08 2020 [Proof: a(n) = 1 iff n - 1 is a prime because n^k - 1 is divisible by n - 1, where k > 1 and n is an even number greater than 2. But if n is a term in A238204, n - m is prime only for some m >= 3. Therefore, a(n) = 0 for n in A238204. - _Jinyuan Wang_, Feb 08 2020] %Y A332029 Cf. A101264, A255707. %K A332029 nonn %O A332029 1,2 %A A332029 _Todor Szimeonov_, Feb 05 2020 %E A332029 More terms from _Jinyuan Wang_, Feb 07 2020