A380986 -id:A380986 - cp's OEIS frontend

A381077 Sorted positions of first appearances in A380986 (product of prime indices minus product of distinct prime indices).

1, 9, 25, 49, 63, 81, 99, 121, 125, 135, 169, 171, 245, 279, 289, 343, 361, 363, 369, 375, 387, 477, 529, 531, 575, 603, 625, 675, 711, 729, 747, 833, 841, 847, 873, 875, 891, 909, 961, 981, 1029, 1083, 1125, 1127, 1179, 1225, 1251, 1377, 1413, 1445, 1467

Offset: 1

Gus Wiseman, Feb 20 2025

nonn

A prime index of n is a number m such that prime(m) divides n. The multiset of prime indices of n is row n of A112798. A position of first appearance in a sequence q is an index k such that q(k) is different from q(j) for all j < k.

All terms are odd.

			The terms together with their prime indices begin:
     1: {}
     9: {2,2}
    25: {3,3}
    49: {4,4}
    63: {2,2,4}
    81: {2,2,2,2}
    99: {2,2,5}
   121: {5,5}
   125: {3,3,3}
   135: {2,2,2,3}
   169: {6,6}
   171: {2,2,8}
   245: {3,4,4}
   279: {2,2,11}

For length instead of product we have A151821, firsts of A046660.
For factors instead of indices we have A381076, sorted firsts of A066503.
For sum of factors instead of product of indices we have A381075 (unsorted A280286), A280292.
For quotient instead of difference we have A380988 (unsorted A380987), firsts of A290106.
For quotient and factors we have A001694 (unsorted A064549), firsts of A003557.
For sum instead of product we have A380957 (unsorted A380956), firsts of A380955.
Sorted firsts of A380986, which has nonzero terms at positions A038838.
A000040 lists the primes, differences A001223.
A003963 gives product of prime indices, distinct A156061.
A005117 lists the squarefree numbers, complement A013929.
A007947 gives squarefree kernel.
A055396 gives least prime index, greatest A061395.
A056239 adds up prime indices, row sums of A112798, length A001222.
A304038 lists distinct prime indices, sum A066328, length A001221.
Cf. A000079, A000720, A001222, A081770, A075255, A116861, A178503, A374248, A379681, A380958.

prix[n_]:=If[n==1,{},Flatten[Cases[FactorInteger[n],{p_,k_}:>Table[PrimePi[p],{k}]]]];
q=Table[Times@@prix[n]-Times@@Union[prix[n]],{n,10000}];
Select[Range[Length[q]],FreeQ[Take[q,#-1],q[[#]]]&]

A280292 a(n) = sopfr(n) - sopf(n).

Original entry on oeis.org

0, 0, 0, 2, 0, 0, 0, 4, 3, 0, 0, 2, 0, 0, 0, 6, 0, 3, 0, 2, 0, 0, 0, 4, 5, 0, 6, 2, 0, 0, 0, 8, 0, 0, 0, 5, 0, 0, 0, 4, 0, 0, 0, 2, 3, 0, 0, 6, 7, 5, 0, 2, 0, 6, 0, 4, 0, 0, 0, 2, 0, 0, 3, 10, 0, 0, 0, 2, 0, 0, 0, 7, 0, 0, 5, 2, 0, 0, 0, 6, 9, 0, 0, 2, 0, 0, 0, 4, 0, 3, 0, 2, 0, 0, 0, 8, 0, 7, 3, 7, 0, 0, 0, 4, 0

Offset: 1

Michel Marcus, Dec 31 2016

nonn

Alladi and Erdős (1977) proved that for all numbers m>=0, m!=1, the sequence of numbers k such that a(k) = m has a positive asymptotic density which is equal to a rational multiple of 1/zeta(2) = 6/Pi^2 (A059956). For example, when m=0, the sequence is the squarefree numbers (A005117), whose density is 6/Pi^2, and when m=2 the sequence is A081770, whose density is 1/Pi^2. - Amiram Eldar, Nov 02 2020

Sum of prime factors minus sum of distinct prime factors. Counting partitions by this statistic (sum minus sum of distinct parts) gives A364916. - Gus Wiseman, Feb 21 2025

Jean-Marie De Koninck and Aleksandar Ivić, Topics in Arithmetical Functions: Asymptotic Formulae for Sums of Reciprocals of Arithmetical Functions and Related Fields, Amsterdam, Netherlands: North-Holland, 1980. See pp. 164-166.
Steven R. Finch, Mathematical Constants II, Encyclopedia of Mathematics and Its Applications, Cambridge University Press, Cambridge, 2018, p. 165.

Antti Karttunen, Table of n, a(n) for n = 1..20000
Krishnaswami Alladi and Paul Erdős, On an additive arithmetic function, Pacific Journal of Mathematics, Vol. 71, No. 2 (1977), pp. 275-294, alternative link.
Jean-Marie De Koninck, Paul Erdős and Aleksandar Ivić, Reciprocals of certain large additive functions, Canadian Mathematical Bulletin, Vol. 24, No. 2 (1981), pp. 225-231.
Aleksandar Ivić, On certain large additive functions, arXiv:math/0311505 [math.NT], 2003.

Cf. A001414 (sopfr), A008472 (sopf), A057521, A059956, A081770, A280163, A338559, A338560.
A multiplicative version is A003557, firsts A064549 (sorted A001694).
For length instead of sum we have A046660.
For product instead of sum we have A066503, firsts A381076.
Positions of first appearances are A280286 (sorted A381075).
For indices instead of factors we have A380955, firsts A380956 (sorted A380957).
For exponents instead of factors we have A380958, firsts A380989.
A000040 lists the primes, differences A001223.
A001222 counts prime factors (distinct A001221).
A003963 gives product of prime indices, distinct A156061, excess A380986.
A005117 lists squarefree numbers, complement A013929.
A007947 gives squarefree kernel.
A020639 gives least prime factor (index A055396), greatest A061395 (index A006530).
A027746 lists prime factors, distinct A027748.
A112798 lists prime indices (sum A056239), distinct A304038 (sum A066328).
Cf. A071625, A075255, A116861, A136565, A175508, A290106, A364916, A381077.

Array[Total@ # - Total@ Union@ # &@ Flatten[ConstantArray[#1, #2] & @@@ FactorInteger@ #] &, 105] (* Michael De Vlieger, Feb 25 2019 *)

sopfr(n) = my(f=factor(n)); sum(j=1, #f~, f[j, 1]*f[j, 2]);
sopf(n) = my(f=factor(n)); sum(j=1, #f~, f[j, 1]);
a(n) = sopfr(n) - sopf(n);

a(n) = A001414(n) - A008472(n).
a(A005117(n)) = 0.
a(n) = A001414(A003557(n)). - Antti Karttunen, Oct 07 2017
Additive with a(1) = 0 and a(p^e) = p*(e-1) for prime p and e > 0. - Werner Schulte, Feb 24 2019
From Amiram Eldar, Nov 02 2020: (Start)
a(n) = a(A057521(n)).
Sum_{n<=x} a(n) ~ x*log(log(x)) + O(x) (Alladi and Erdős, 1977).
Sum_{n<=x, n nonsquarefree} 1/a(n) ~ c*x + O(sqrt(x)*log(x)), where c = Integral_{t=0..1} (F(t)-6/Pi^2)/t dt, and F(t) = Product_{p prime} (1-1/p)*(1-1/(t^p - p)) (De Koninck et al., 1981; Finch, 2018), or, equivalently c = Sum_{k>=2} d(k)/k = 0.1039..., where d(k) = (6/Pi^2)*A338559(k)/A338560(k) is the asymptotic density of the numbers m with a(m) = k (Alladi and Erdős, 1977; Ivić, 2003). (End)

More terms from Antti Karttunen, Oct 07 2017

A380955 Sum of prime indices of n (with multiplicity) minus sum of distinct prime indices of n.

Original entry on oeis.org

0, 0, 0, 1, 0, 0, 0, 2, 2, 0, 0, 1, 0, 0, 0, 3, 0, 2, 0, 1, 0, 0, 0, 2, 3, 0, 4, 1, 0, 0, 0, 4, 0, 0, 0, 3, 0, 0, 0, 2, 0, 0, 0, 1, 2, 0, 0, 3, 4, 3, 0, 1, 0, 4, 0, 2, 0, 0, 0, 1, 0, 0, 2, 5, 0, 0, 0, 1, 0, 0, 0, 4, 0, 0, 3, 1, 0, 0, 0, 3, 6, 0, 0, 1, 0, 0, 0

Offset: 1

Gus Wiseman, Feb 11 2025

nonn

A prime index of n is a number m such that prime(m) divides n. The multiset of prime indices of n is row n of A112798.

			The prime indices of 96 are {1,1,1,1,1,2}, with sum 7, and with distinct prime indices {1,2}, with sum 3, so a(96) = 7 - 3 = 4.

Positions of 0's are A005117, complement A013929.
For length instead of sum we have A046660.
Positions of 1's are A081770.
For factors instead of indices we have A280292, firsts A280286 (sorted A381075).
A multiplicative version is A290106.
Counting partitions by this statistic gives A364916.
Dominates A374248.
Positions of first appearances are A380956, sorted A380957.
For prime multiplicities instead of prime indices we have A380958.
For product instead of sum we have A380986.
A000040 lists the primes, differences A001223.
A055396 gives least prime index, greatest A061395.
A056239 adds up prime indices, row sums of A112798, length A001222.
A304038 lists distinct prime indices, sum A066328, length A001221.
Cf. A000720, A071625, A075254, A075255, A116861, A124010, A136565, A178503, A325033, A325034, A366528, A366749, A379681.

prix[n_]:=If[n==1,{},Flatten[Cases[FactorInteger[n],{p_,k_}:>Table[PrimePi[p],{k}]]]];
Table[Total[prix[n]]-Total[Union[prix[n]]],{n,100}]

a(n) = A056239(n) - A066328(n).

Additive: a(m*n) = a(m) + a(n) if gcd(m,n) = 1.

A380956 Position of first appearance of n in A380955 (sum of prime indices minus sum of distinct prime indices).

Original entry on oeis.org

1, 4, 8, 16, 27, 64, 81, 256, 243, 529, 729, 961, 1369, 1681, 1849, 2209, 2809, 3481, 3721, 4489, 5041, 5329, 6241, 6889, 7921, 9409, 10201, 10609, 11449, 11881, 12769, 16129, 17161, 18769, 19321, 22201, 22801, 24649, 26569, 27889, 29929, 32041, 32761, 36481

Offset: 0

Gus Wiseman, Feb 12 2025

nonn

A prime index of n is a number m such that prime(m) divides n. The multiset of prime indices of n is row n of A112798.

Also the position of first appearance of n in A374248.

			The terms together with their prime indices begin:
     1: {}
     4: {1,1}
     8: {1,1,1}
    16: {1,1,1,1}
    27: {2,2,2}
    64: {1,1,1,1,1,1}
    81: {2,2,2,2}
   256: {1,1,1,1,1,1,1,1}
   243: {2,2,2,2,2}
   529: {9,9}
   729: {2,2,2,2,2,2}
   961: {11,11}
  1369: {12,12}
  1681: {13,13}
  1849: {14,14}
  2209: {15,15}

For length instead of sum we have A151821.
For factors instead of indices we have A280286 (sorted A381075), firsts of A280292.
Counting partitions by this statistic gives A364916.
Positions of first appearances in A380955.
The sorted version is A380957.
For product instead of sum we have firsts of A380986.
A multiplicative version is A380987 (sorted A380988), firsts of A290106.
For prime multiplicities instead of prime indices we have A380989, firsts of A380958.
A000040 lists the primes, differences A001223.
A005117 lists squarefree numbers, complement A013929.
A055396 gives least prime index, greatest A061395.
A056239 adds up prime indices, row sums of A112798, length A001222.
A304038 lists distinct prime indices, sum A066328, length A001221.
Cf. A000720, A046660, A071625, A075255, A116861, A136565, A156061, A178503, A175508, A325033, A366528, A366749, A374248.

prix[n_]:=If[n==1,{},Flatten[Cases[FactorInteger[n],{p_,k_}:>Table[PrimePi[p],{k}]]]];
mnrm[s_]:=If[Min@@s==1,mnrm[DeleteCases[s-1,0]]+1,0];
q=Table[Total[prix[n]]-Total[Union[prix[n]]],{n,1000}];
Table[Position[q,k][[1,1]],{k,0,mnrm[q+1]-1}]

After a(12) = 961, this appears to converge to prime(n)^2.

A380957 Sorted positions of first appearances in A380955 (sum of prime indices minus sum of distinct prime indices).

Original entry on oeis.org

1, 4, 8, 16, 27, 64, 81, 243, 256, 529, 729, 961, 1369, 1681, 1849, 2209, 2809, 3481, 3721, 4489, 5041, 5329, 6241, 6889, 7921, 9409, 10201, 10609, 11449, 11881, 12769, 16129, 17161, 18769, 19321, 22201, 22801, 24649, 26569, 27889, 29929, 32041, 32761, 36481

Offset: 1

Gus Wiseman, Feb 13 2025

nonn

Also appears to be sorted firsts of A374248.

For length instead of sum we have A151821.
Counting partitions by this statistic (sum minus sum of distinct parts) gives A364916.
Sorted positions of first appearances in A380955.
The unsorted version is A380956.
For product instead of sum we have sorted firsts of A380986.
The multiplicative version is A380988, unsorted A380987, firsts of A290106.
For prime multiplicities instead of prime indices we have A380989, firsts of A380958.
For factors instead of indices we have A381075, see A280286, A280292.
A000040 lists the primes, differences A001223.
A005117 lists squarefree numbers, complement A013929.
A055396 gives least prime index, greatest A061395.
A056239 adds up prime indices, row sums of A112798, counted by A001222.
Cf. A000720, A046660, A071625, A075255, A116861, A136565, A156061, A178503, A175508, A325033, A366528, A366749, A374248.

prix[n_]:=If[n==1,{},Flatten[Cases[FactorInteger[n],{p_,k_}:>Table[PrimePi[p],{k}]]]];
q=Table[Total[prix[n]]-Total[Union[prix[n]]],{n,1000}];
Select[Range[Length[q]],FreeQ[Take[q,#-1],q[[#]]]&]

A380958 Number of prime factors of n (with multiplicity) minus sum of distinct prime exponents of n.

Original entry on oeis.org

0, 0, 0, 0, 0, 1, 0, 0, 0, 1, 0, 0, 0, 1, 1, 0, 0, 0, 0, 0, 1, 1, 0, 0, 0, 1, 0, 0, 0, 2, 0, 0, 1, 1, 1, 2, 0, 1, 1, 0, 0, 2, 0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 1, 0, 1, 1, 0, 1, 0, 1, 0, 0, 1, 2, 0, 0, 1, 2, 0, 0, 0, 1, 0, 0, 1, 2, 0, 0, 0, 1, 0, 1, 1, 1, 1

Offset: 1

Gus Wiseman, Feb 13 2025

nonn

			The prime factors of 2100 are {2,2,3,5,5,7}, with distinct multiplicities {1,2}, so a(2100) = 6 - (1+2) = 3.

Positions of 0's are A130091, complement A130092.
The RHS (sum of distinct prime exponents) is A136565.
For prime factors instead of exponents see A280292, firsts A280286, sorted A381075.
For prime indices instead of exponents see A380955, firsts A380956, sorted A380957.
Position of first appearance of n is A380989(n).
A000040 lists the primes, differences A001223.
A005117 lists squarefree numbers, complement A013929.
A005361 gives product of prime signature.
A055396 gives least prime index, greatest A061395.
A056239 (reverse A296150) adds up prime indices, row sums of A112798, counted by A001222.
A124010 lists prime exponents (signature); see A001222, A001221, A051903, A051904.
Cf. A000720, A046660, A071625, A075254, A075255, A076694, A081770, A116861, A178503, A290106, A380986.

Table[PrimeOmega[n]-Total[Union[Last/@If[n==1,{},FactorInteger[n]]]],{n,100}]

a(n) = A001222(n) - A136565(n).

A380989 Position of first appearance of n in A380958 (number of prime factors minus sum of distinct prime exponents).

Original entry on oeis.org

1, 6, 30, 210, 900, 7776, 27000, 279936, 810000, 9261000, 24300000, 362797056, 729000000, 13060694016, 21870000000, 408410100000, 656100000000, 16926659444736, 19683000000000, 609359740010496, 590490000000000, 18010885410000000, 17714700000000000

Offset: 0

Gus Wiseman, Feb 18 2025

nonn

Is this sequence strictly increasing?
From David Consiglio, Jr., Feb 20 2025: (Start)
The answer to the question above is: no, a(21) < a(20). And all subsequent odd indexed terms are lower than their even predecessors.
All terms must be a product of x primes (with multiplicity) to the y power where x-y = n and x mod y = 0. There are very few combinations of numbers that meet these criteria, so checking all of them to find the minimum outcome is quite fast.
Example --> n=5
6 primes to the 1 power --> 6 distinct primes
  2*3*5*7*11*13 = 30030
7 primes to the 2 power -- disallowed (5 mod 2 = 1)
8 primes to the 3 power -- disallowed (4 mod 3 = 1)
9 primes to the 4 power -- disallowed (9 mod 4 = 1)
10 primes to the 5 power --> 2 distinct primes
  2*2*2*2*2*3*3*3*3*3 = 7776
The minimum value is 7776 and thus a(5) = 7776. (End)

			The terms together with their prime indices begin:
        1: {}
        6: {1,2}
       30: {1,2,3}
      210: {1,2,3,4}
      900: {1,1,2,2,3,3}
     7776: {1,1,1,1,1,2,2,2,2,2}
    27000: {1,1,1,2,2,2,3,3,3}
   279936: {1,1,1,1,1,1,1,2,2,2,2,2,2,2}
   810000: {1,1,1,1,2,2,2,2,3,3,3,3}
  9261000: {1,1,1,2,2,2,3,3,3,4,4,4}

David Consiglio, Jr., Table of n, a(n) for n = 0..100
David Consiglio, Jr., Python program

Position of first appearance of n in A001222 - A136565.
For factors instead of exponents we have A280286 (sorted A381075), firsts of A280292.
For indices instead of exponents we have A380956 (sorted A380957), firsts of A380955.
A000040 lists the primes, differences A001223.
A005361 gives product of prime exponents.
A055396 gives least prime index, greatest A061395.
A056239 (reverse A296150) adds up prime indices, row sums of A112798.
A124010 lists prime exponents (signature); A001221, A051903, A051904.
Cf. A046660, A071625, A075254, A075255, A076694, A130091, A130092, A290106, A380986.

prisig[n_]:=If[n==1,{},Last/@FactorInteger[n]];
q=Table[Total[prisig[n]]-Total[Union[prisig[n]]],{n,10000}];
mnrm[s_]:=If[Min@@s==1,mnrm[DeleteCases[s-1,0]]+1,0];
Table[Position[q,k][[1,1]],{k,0,mnrm[q+1]-1}]

a(10)-a(11) from Michel Marcus, Feb 20 2025

a(12) and beyond from David Consiglio, Jr., Feb 20 2025

A380987 Position of first appearance of n in A290106 (product of prime indices divided by product of distinct prime indices).

Original entry on oeis.org

1, 9, 25, 27, 121, 169, 289, 81, 125, 841, 961, 675, 1681, 1849, 2209, 243, 3481, 1125, 4489, 3267, 5329, 6241, 6889, 2025, 1331, 10201, 625, 7803, 11881, 12769, 16129, 729, 18769, 19321, 22201, 2197, 24649, 26569, 27889, 9801, 32041, 32761, 36481, 25947

Offset: 1

Gus Wiseman, Feb 14 2025

nonn

A prime index of n is a number m such that prime(m) divides n. The multiset of prime indices of n is row n of A112798.

All terms are odd.

			The first position of 12 in A290106 is 675, with prime indices {2,2,2,3,3}, so a(12) = 675.
The terms together with their prime indices begin:
      1: {}
      9: {2,2}
     25: {3,3}
     27: {2,2,2}
    121: {5,5}
    169: {6,6}
    289: {7,7}
     81: {2,2,2,2}
    125: {3,3,3}
    841: {10,10}
    961: {11,11}
    675: {2,2,2,3,3}
   1681: {13,13}
   1849: {14,14}
   2209: {15,15}
    243: {2,2,2,2,2}
   3481: {17,17}
   1125: {2,2,3,3,3}

For factors instead of indices we have A064549 (sorted A001694), firsts of A003557.
The additive version for factors is A280286 (sorted A381075), firsts of A280292.
Position of first appearance of n in A290106.
The additive version is A380956 (sorted A380957), firsts of A380955.
For difference instead of quotient see A380986.
The sorted version is A380988.
A000040 lists the primes, differences A001223.
A003963 gives product of prime indices, distinct A156061.
A005117 lists squarefree numbers, complement A013929.
A055396 gives least prime index, greatest A061395.
A056239 adds up prime indices, row sums of A112798, length A001222.
A304038 lists distinct prime indices, sum A066328, length A001221.
Cf. A000720, A007947, A046660, A066503, A071625, A136565, A178503, A175508, A325034, A379681.

prix[n_]:=If[n==1,{},Flatten[Cases[FactorInteger[n],{p_,k_}:>Table[PrimePi[p],{k}]]]];
mnrm[s_]:=If[Min@@s==1,mnrm[DeleteCases[s-1,0]]+1,0];
q=Table[Times@@prix[n]/Times@@Union[prix[n]],{n,10000}];
Table[Position[q,k][[1,1]],{k,mnrm[q]}]

A380988 Sorted positions of first appearances in A290106 (product of prime indices divided by product of distinct prime indices).

Original entry on oeis.org

1, 9, 25, 27, 81, 121, 125, 169, 243, 289, 625, 675, 729, 841, 961, 1125, 1331, 1681, 1849, 2025, 2187, 2197, 2209, 3125, 3267, 3481, 4489, 4913, 5329, 5625, 6075, 6241, 6561, 6889, 7803, 9801, 10125, 10201, 11881, 11979, 12769, 14641, 15125, 15625, 16129

Offset: 1

Gus Wiseman, Feb 18 2025

nonn

A prime index of n is a number m such that prime(m) divides n. The multiset of prime indices of n is row n of A112798.

All terms are odd.

			The prime indices of 225 are {2,2,3,3}, with image A290106(225) = 6. The prime indices of 169 are {6,6}, also with image 6. Since the latter is the first with image 6, 169 is in the sequence, and 225 is not.
The terms together with their prime indices begin:
     1: {}
     9: {2,2}
    25: {3,3}
    27: {2,2,2}
    81: {2,2,2,2}
   121: {5,5}
   125: {3,3,3}
   169: {6,6}
   243: {2,2,2,2,2}
   289: {7,7}
   625: {3,3,3,3}
   675: {2,2,2,3,3}
   729: {2,2,2,2,2,2}
   841: {10,10}
   961: {11,11}
  1125: {2,2,3,3,3}
  1331: {5,5,5}
  1681: {13,13}
  1849: {14,14}
  2025: {2,2,2,2,3,3}

For factors instead of indices we have A001694 (unsorted A064549), firsts of A003557.
Sorted firsts of A290106.
The additive version is A380957 (sorted A380956), firsts of A380955.
For difference instead of quotient see A380986.
The unsorted version is A380987.
The additive version for factors is A381075 (unsorted A280286), firsts of A280292.
A000040 lists the primes, differences A001223.
A003963 gives product of prime indices, distinct A156061.
A005117 lists squarefree numbers, complement A013929.
A055396 gives least prime index, greatest A061395.
A056239 adds up prime indices, row sums of A112798, length A001222.
A304038 lists distinct prime indices, sum A066328, length A001221.
Cf. A000720, A007947, A046660, A066503, A071625, A136565, A178503, A175508, A325034, A379681.

prix[n_]:=If[n==1,{},Flatten[Cases[FactorInteger[n],{p_,k_}:>Table[PrimePi[p],{k}]]]];
q=Table[Times@@prix[n]/Times@@Union[prix[n]],{n,1000}];
Select[Range[Length[q]],FreeQ[Take[q,#-1],q[[#]]]&]

A381076 Sorted positions of first appearances in A066503 (n minus squarefree kernel of n).

Original entry on oeis.org

1, 4, 8, 16, 18, 20, 24, 25, 27, 32, 44, 48, 50, 52, 54, 64, 68, 72, 75, 76, 80, 81, 92, 96, 98, 108, 112, 116, 121, 125, 128, 144, 148, 152, 160, 162, 164, 172, 175, 176, 188, 189, 192, 196, 198, 200, 212, 216, 232, 236, 242, 243, 244, 256, 260, 264, 268, 272

Offset: 1

Gus Wiseman, Feb 18 2025

nonn

In A066503, each value appears for the first time at one of these positions.

For quotient instead of difference we have A001694, sorted firsts of A003557.
Sorted positions of first appearances in A066503.
For indices and sum we have A380957 (unsorted A380956), firsts of A380955.
For indices and quotient we have A380988 (unsorted A380987), firsts of A290106.
For sum instead of product we have A381075, sorted firsts of A280292, see A280286.
For indices instead of factors we have A381077, sorted firsts of A380986.
A000040 lists the primes, differences A001223.
A001414 adds up prime factors (indices A056239), row sums of A027746 (indices A112798).
A003963 gives product of prime indices, distinct A156061.
A005117 lists squarefree numbers, complement A013929.
A007947 gives squarefree kernel.
A020639 gives least prime factor (index A055396), greatest A061395 (index A006530).
Cf. A001221, A001222, A038838, A046660, A075255, A081770, A116861, A136565, A178503, A175508, A304038, A380989.

prifacs[n_]:=If[n==1,{},Flatten[Apply[ConstantArray,FactorInteger[n],{1}]]];
q=Table[Times@@prifacs[n]-Times@@Union[prifacs[n]],{n,1000}];
Select[Range[Length[q]],FreeQ[Take[q,#-1],q[[#]]]&]

cp's OEIS Frontend

A381077 Sorted positions of first appearances in A380986 (product of prime indices minus product of distinct prime indices).

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

A280292 a(n) = sopfr(n) - sopf(n).

Views

Author

Keywords

Comments

References

Links

Crossrefs

Programs

Mathematica

PARI

Formula

Extensions

A380955 Sum of prime indices of n (with multiplicity) minus sum of distinct prime indices of n.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

Formula

A380956 Position of first appearance of n in A380955 (sum of prime indices minus sum of distinct prime indices).

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

Formula

A380957 Sorted positions of first appearances in A380955 (sum of prime indices minus sum of distinct prime indices).

Views

Author

Keywords

Comments

Crossrefs

Programs

Mathematica

A380958 Number of prime factors of n (with multiplicity) minus sum of distinct prime exponents of n.

Views

Author

Keywords

Examples

Crossrefs

Programs

Mathematica

Formula

A380989 Position of first appearance of n in A380958 (number of prime factors minus sum of distinct prime exponents).

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

Extensions

A380987 Position of first appearance of n in A290106 (product of prime indices divided by product of distinct prime indices).

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica