|
Search: id:A092308
|
|
|
| A092308 |
|
For p=prime(n), a(n) = the number of primes q such that q-1 divides p-1. |
|
+0
2
|
|
| 1, 2, 3, 3, 3, 5, 4, 4, 3, 4, 5, 7, 5, 4, 3, 4, 3, 8, 5, 4, 8, 4, 3, 5, 7, 5, 4, 3, 8, 6, 6, 4, 4, 5, 4, 6, 8, 5, 3, 4, 3, 11, 4, 8, 5, 7, 8, 4, 3, 6, 5, 3, 11, 4, 5, 3, 4, 7, 8, 8, 4, 4, 6, 4, 9, 4, 8, 10, 3, 7, 7, 3, 4, 6, 7, 3, 4, 11, 8, 8, 4, 13, 4, 11, 4, 3, 7, 7, 6, 7, 3, 3, 6, 5, 5, 3, 4, 8, 6, 14, 6, 4
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
COMMENT
|
For many primes p, there are only 3 primes (2,3,p) such the q-1|p-1. See A092307 for a list of those primes.
|
|
LINKS
|
T. D. Noe, Table of n, a(n) for n=1..1000
|
|
EXAMPLE
|
a(12)=7 because for prime(12)=37 there are seven primes q={2, 3, 5, 7, 13, 19, 37} such that q-1 divides 36.
|
|
MATHEMATICA
|
Table[p=Prime[n]; Length[Select[Divisors[p-1]+1, PrimeQ]], {n, 150}]
|
|
CROSSREFS
|
Cf. A092307 (primes for which a(n)=3).
Sequence in context: A057957 A076559 A102601 this_sequence A081831 A111912 A096288
Adjacent sequences: A092305 A092306 A092307 this_sequence A092309 A092310 A092311
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
T. D. Noe (noe(AT)sspectra.com), Feb 12 2004
|
|
|
Search completed in 0.002 seconds
|
