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 A308610 #34 Feb 24 2020 14:25:50
%S A308610 7,194,219
%N A308610 Numbers k such that Sum_{j=1..k} composite(j)^composite(j) is prime, where composite(j) is the j-th composite number.
%C A308610 If it exists, a(4) > 25800.
%e A308610 7 is a term because for the first 7 composites, 4^4 + 6^6 + 8^8 + 9^9 + 10^10 + 12^12 + 14^14 = 11120933330250889 is prime.
%t A308610 f[ n_Integer ] := Block[ {k = n + PrimePi[ n ] + 1}, While[ k - PrimePi[ k ] - 1 != n, k++ ]; k ]; s = 0; Do[ s = s + f[n]^f[n]; If[ PrimeQ[ s ], Print[ n ] ], {n, 1, 1000} ]
%Y A308610 Cf. A000040, A002808, A053782, A073826, A132637.
%K A308610 nonn,more,bref
%O A308610 1,1
%A A308610 _Metin Sariyar_, Aug 23 2019