[go: up one dir, main page]

login
Search: a342480 -id:a342480
     Sort: relevance | references | number | modified | created      Format: long | short | data
a(n) is the numerator of the asymptotic density of numbers whose second smallest prime divisor (A119288) is prime(n).
+10
3
0, 1, 1, 1, 46, 44, 288, 33216, 613248, 151296, 391584768, 2383570944, 86830424064, 206470840320, 21270238986240, 987259950858240, 1262040231444480, 3022250536693923840, 3884253754215628800, 1102040800033347993600, 1892288242221318144000, 5616902226049109065728000
OFFSET
1,5
COMMENTS
The second smallest prime divisor of a number k is the second member in the ordered list of the distinct prime divisors of k. All the numbers that are not prime powers (A000961) have a second smallest prime divisor.
REFERENCES
József Sándor and Borislav Crstici, Handbook of Number theory II, Kluwer Academic Publishers, 2004, Chapter 4, pp. 337-341.
LINKS
Paul Erdős and Gérald Tenenbaum, Sur les densités de certaines suites d'entiers, Proc. London Math. Soc. (3), Vol. 59, No. 3 (1989), pp. 417-438; alternative link.
FORMULA
a(n)/A342480(n) = (1/prime(n)) * Product_{q prime < prime(n)} (1 - 1/q) * Sum_{q prime < prime(n)} 1/(q-1).
Sum_{n>=1} a(n)/A342480(n) = 1 (since the asymptotic density of numbers without a second smallest prime divisor, i.e., the prime powers, is 0).
EXAMPLE
The fractions begin with 0, 1/6, 1/10, 1/15, 46/1155, 44/1365, 288/12155, 33216/1616615, 613248/37182145, 151296/11849255, 391584768/33426748355, ...
a(1) = 0 since there are no numbers whose second smallest prime divisor is prime(1) = 2.
a(2)/A342480(2) = 1/6 since the numbers whose second smallest prime divisor is prime(2) = 3 are the positive multiples of 6.
a(3)/A342480(3) = 1/10 since the numbers whose second smallest prime divisor is prime(3) = 5 are the numbers congruent to {10, 15, 20} (mod 30) whose density is 3/30 = 1/10.
MATHEMATICA
f[n_] := Module[{p = Prime[n], q}, q = Select[Range[p - 1], PrimeQ]; Plus @@ (1/(q - 1))*Times @@ ((q - 1)/q)/p]; Numerator @ Array[f, 30]
CROSSREFS
Cf. A000961, A038110, A038111, A119288, A342480 (denominators).
KEYWORD
nonn,easy,frac
AUTHOR
Amiram Eldar, Mar 13 2021
STATUS
approved
a(n) = denominator((prime(n)-1)/prime(n)#), where prime(n)# = A002110(n) is the n-th primorial.
+10
2
2, 3, 15, 35, 231, 5005, 255255, 1616615, 10140585, 462120945, 6685349671, 1236789689135, 30425026352721, 311494317420715, 13367169186706335, 1253429172199617105, 33151040519900217915, 3909612711980232366109, 119065478046670712967865, 7970583287524270870963077
OFFSET
1,1
COMMENTS
See A356093 for details.
LINKS
MATHEMATICA
primorial[n_] := Product[Prime[i], {i, 1, n}]; Denominator[Table[(Prime[i] - 1)/primorial[i], {i, 1, 20}]]
PROG
(PARI) a(n) = denominator((prime(n)-1)/factorback(primes(n))); \\ Michel Marcus, Jul 26 2022
(Python)
from math import gcd
from sympy import primorial, prime
def A356094(n): return (p:=primorial(n))//gcd(p, prime(n)-1) # Chai Wah Wu, Jul 26 2022
CROSSREFS
Cf. A002110, A356093 (numerators).
Similar sequences: A038111, A338560, A340819, A341432, A342451, A342480.
KEYWORD
nonn,frac
AUTHOR
Amiram Eldar, Jul 26 2022
STATUS
approved

Search completed in 0.007 seconds