|
Search: id:A072627
|
|
|
| A072627 |
|
Number of divisors d of n such that d-1 is prime. |
|
+0
2
|
|
| 0, 0, 1, 1, 0, 2, 0, 2, 1, 0, 0, 4, 0, 1, 1, 2, 0, 3, 0, 2, 1, 0, 0, 6, 0, 0, 1, 2, 0, 3, 0, 3, 1, 0, 0, 5, 0, 1, 1, 3, 0, 4, 0, 2, 1, 0, 0, 7, 0, 0, 1, 1, 0, 4, 0, 3, 1, 0, 0, 7, 0, 1, 1, 3, 0, 2, 0, 2, 1, 1, 0, 8, 0, 1, 1, 2, 0, 2, 0, 4, 1, 0, 0, 7, 0, 0, 1, 3, 0, 5, 0, 1, 1, 0, 0, 8, 0, 2, 1, 2, 0, 3, 0, 3, 1
(list; graph; listen)
|
|
|
OFFSET
|
1,6
|
|
|
COMMENT
|
A001221[InvSigma[n]]<A000005[n]
|
|
EXAMPLE
|
If n=p is prime then divisors-1={1,p}-1={0,p-1} so a(p)=0. n=240: a(240)=12 because primes of -1+d form are: {2,3,5,7,11,19,23,29,47,59,79,239}. These and only these divisors are present in any InvSigma of n, like:InvSig[240]= {114,135,158,177,203,209,239} with {2,3,19,3,5,2,79,3,59,7,29,11,19,239} p-divisors.
|
|
MATHEMATICA
|
di[x_] := Divisors[x] dp[x_] := Part[di[x], Flatten[Position[PrimeQ[ -1+di[x]], True]]]-1 Table[Length[dp[w]], {w, 1, 128}]
|
|
CROSSREFS
|
Cf. A000203, A000005.
Sequence in context: A135298 A006996 A112604 this_sequence A069848 A118682 A083054
Adjacent sequences: A072624 A072625 A072626 this_sequence A072628 A072629 A072630
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Labos E. (labos(AT)ana.sote.hu), Jun 28 2002
|
|
|
Search completed in 0.002 seconds
|
