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 A058064 #7 Aug 05 2025 10:02:22
%S A058064 0,0,0,1,0,0,1,0,0,5,0,1,2,0,0,2,1,0,1,0,0,1,0,1,1,0,2
%N A058064 Find least k such that (n+1)^k + n^k is a prime (A057856); then k=2^m and sequence gives values of m.
%F A058064 a(n) = A007814(A057856(n)). - _Michel Marcus_, Aug 05 2025
%t A058064 Table[ k = 0; While[ !PrimeQ[ (n + 1)^(2^k) + n^(2^k) ], k++ ]; k, {n, 1, 27} ]
%Y A058064 Cf. A007814, A057856.
%K A058064 hard,nonn
%O A058064 1,10
%A A058064 _Robert G. Wilson v_, Nov 14 2000