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 A225192 #27 Mar 18 2014 01:37:13
%S A225192 0,0,1,1,0,2,1,1,1,1,0,2,0,2,1,2,0,2,1,2,1,1,0,3,0,0,1,1,0,3,1,2,1,2,
%T A225192 1,2,1,3,0,1,1,3,0,2,2,1,0,2,1,2,1,1,1,2,1,2,2,1,0,3,0,1,1,2,0,3,0,2,
%U A225192 1,1,1,1,0,1,1,3,1,3,1,2,0,2,1,4,0,1,2
%N A225192 Number of primes p such that p is -1 mod n where p < n-th prime.
%C A225192 Primes p(n) such that a(n) = a(n + 1): 2, 5, 17, 19, 23, 73, 97, 103, 173, 193, 233, 239, 263, 293, 347, 349, 353, 373, 449, 467,...
%C A225192 Primes p(n) such that p is not -1 mod n and mod n+1 for all prime p < p(n+1): 2, 97, 829, 1597, 2251,...
%C A225192 Smallest k such that a(k) = n:, 1, 3, 6, 24, 84, 90,...
%C A225192 Numbers n such that a(n) is equal to number of primes p such that n is -1 mod p where p < n-th prime: 1, 2, 3, 4, 7, 8, 10, 14, 15, 20, 22, 28, 31, 32, 34, 40, 44, 45, 46, 50, 52, 55, 57, 63, 65, 70, 72, 87,...
%H A225192 Charles R Greathouse IV, <a href="/A225192/b225192.txt">Table of n, a(n) for n = 1..10000</a>
%e A225192 Prime 11 == - 1 (mod 12), prime 23 == -1 (mod 12) and 11, 23 < prime(12) = 37, so a(12) = 2.
%t A225192 Table[s = Prime[Range[n - 1]]; Length[Select[s, Mod[#, n] == n - 1 &]], {n, 93}] (* _T. D. Noe_, May 13 2013 *)
%o A225192 (PARI) a(n)=my(s); forstep(p=n-1,prime(n)-1,n,s+=isprime(p)); s \\ _Charles R Greathouse IV_, Mar 18 2014
%Y A225192 Cf. A038700, A219109.
%K A225192 nonn
%O A225192 1,6
%A A225192 _Irina Gerasimova_, May 01 2013