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 A316504 #23 Oct 06 2019 09:05:06
%S A316504 0,1,2,3,5,7,11,13,17,19,23,29,37,41,47,53,59,71,83,89,101,109,139,
%T A316504 149,157,179,199,307,461,571
%N A316504 Numbers n such that A090086(n+1) > n+1.
%C A316504 Probably complete.
%C A316504 Numbers n such that A090086(n+1) = A007535(n+1).
%C A316504 For n > 1, if A090086(n+1) > n+1, then n is a prime.
%o A316504 (PARI) a090086(n) = {forcomposite(k=2, , if (Mod(n, k)^(k-1) == 1, return (k)); ); }
%o A316504 isok(n) = a090086(n+1) > n+1; \\ _Michel Marcus_, Aug 12 2018
%Y A316504 Cf. A000040, A090086, A007535, A317851.
%K A316504 nonn,more
%O A316504 1,3
%A A316504 _Thomas Ordowski_, Aug 12 2018