For p = prime(n), a(n) is the number of primes q such that pq is a base-2 pseudoprime; that is, 2^(pq-1) = 1 mod pq.
A085014
For p = prime(n), a(n) is the number of primes q such that pq is a base-2 pseudoprime; that is, 2^(pq-1) = 1 mod pq.
Terms
- a(0) =0a(1) =0a(2) =0a(3) =1a(4) =0a(5) =1a(6) =1a(7) =2a(8) =1a(9) =3a(10) =2a(11) =1a(12) =3a(13) =2a(14) =2a(15) =4a(16) =1a(17) =2a(18) =3a(19) =5a(20) =4a(21) =3a(22) =6a(23) =4a(24) =4a(25) =6a(26) =4a(27) =5a(28) =4a(29) =6
External references
- oeis: A085014