This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A225192 Number of primes p such that p is -1 mod n where p < n-th prime. 1

%I

%S 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 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 1,1,1,1,0,1,1,3,1,3,1,2,0,2,1,4,0,1,2

%N Number of primes p such that p is -1 mod n where p < n-th prime.

%C 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 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 Smallest k such that a(k) = n:, 1, 3, 6, 24, 84, 90,...

%C 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 Charles R Greathouse IV, <a href="/A225192/b225192.txt">Table of n, a(n) for n = 1..10000</a>

%e Prime 11 == - 1 (mod 12), prime 23 == -1 (mod 12) and 11, 23 < prime(12) = 37, so a(12) = 2.

%t Table[s = Prime[Range[n - 1]]; Length[Select[s, Mod[#, n] == n - 1 &]], {n, 93}] (* _T. D. Noe_, May 13 2013 *)

%o (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 Cf. A038700, A219109.

%K nonn

%O 1,6

%A _Irina Gerasimova_, May 01 2013

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified October 22 22:34 EDT 2019. Contains 328335 sequences. (Running on oeis4.)