A324934 -id:A324934 - cp's OEIS frontend

A324850 Numbers divisible by the product of their prime indices.

1, 2, 4, 6, 8, 12, 16, 24, 28, 30, 32, 36, 48, 56, 60, 64, 72, 96, 112, 120, 128, 144, 152, 156, 168, 180, 192, 216, 224, 240, 256, 288, 304, 312, 330, 336, 360, 384, 432, 448, 476, 480, 512, 576, 608, 624, 660, 672, 720, 768, 784, 828, 840, 848, 864, 888, 896

Offset: 1

Gus Wiseman, Mar 18 2019

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, with product A003963(n). For example, the prime indices of 30 are {1,2,3}, with product 6, which divides 30, so 30 is in the sequence.

			The sequence of terms together with their prime indices begins:
   1: {}
   2: {1}
   4: {1,1}
   6: {1,2}
   8: {1,1,1}
  12: {1,1,2}
  16: {1,1,1,1}
  24: {1,1,1,2}
  28: {1,1,4}
  30: {1,2,3}
  32: {1,1,1,1,1}
  36: {1,1,2,2}
  48: {1,1,1,1,2}
  56: {1,1,1,4}
  60: {1,1,2,3}
  64: {1,1,1,1,1,1}
  72: {1,1,1,2,2}
  96: {1,1,1,1,1,2}

Amiram Eldar, Table of n, a(n) for n = 1..10000

Cf. A003963, A036844, A120383, A324847, A324756, A324758, A324847, A324848, A324849, A324852, A324853, A324856, A324923, A324924, A324925, A324931.

Select[Range[100],Divisible[#,Times@@Cases[If[#==1,{},FactorInteger[#]],{p_,k_}:>PrimePi[p]^k]]&]

isok(n) = my(f=factor(n)); !(n % prod(k=1, #f~, primepi(f[k,1])^f[k,2])); \\ Michel Marcus, Mar 22 2019

n/A003963(n) = A324933(n)/A324934(n).

A324923 Number of distinct factors in the factorization of n into factors q(i) = prime(i)/i, i > 0.

Original entry on oeis.org

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

Offset: 1

Gus Wiseman, Mar 20 2019

nonn

Also the number of distinct proper terminal subtrees of the rooted tree with Matula-Goebel number n. See illustrations in A061773.

			The factorization 22 = q(1)^2 q(2) q(3) q(5) has four distinct factors, so a(22) = 4.

One less than A317713.
Cf. A000081, A003963, A061773, A061775, A109082, A109129, A120383, A196050.
Cf. A324850, A324922, A324924, A324925, A324931, A324934, A324935, A324936, A366385, A366386.

difac[n_]:=If[n==1,{},With[{i=PrimePi[FactorInteger[n][[1,1]]]},Sort[Prepend[difac[n*i/Prime[i]],i]]]];
Table[Length[Union[difac[n]]],{n,100}]

A006530(n) = if(1==n, n, my(f=factor(n)); f[#f~, 1]);
A324923(n) = { my(lista = List([]), gpf, i); while(n > 1, gpf=A006530(n); i = primepi(gpf); n /= gpf; n *= i; listput(lista,i)); #Set(lista); }; \\ Antti Karttunen, Oct 23 2023

a(n) = A317713(n) - 1.

a(n) = A196050(n) - A366386(n). - Antti Karttunen, Oct 23 2023

Data section extended up to a(108) by Antti Karttunen, Oct 23 2023

A324924 Irregular triangle read by rows giving the factorization of n into factors q(i) = prime(i)/i, i > 0.

Original entry on oeis.org

1, 1, 2, 1, 1, 1, 2, 3, 1, 1, 2, 1, 1, 4, 1, 1, 1, 1, 1, 2, 2, 1, 1, 2, 3, 1, 2, 3, 5, 1, 1, 1, 2, 1, 1, 2, 6, 1, 1, 1, 4, 1, 1, 2, 2, 3, 1, 1, 1, 1, 1, 1, 4, 7, 1, 1, 1, 2, 2, 1, 1, 1, 8, 1, 1, 1, 2, 3, 1, 1, 1, 2, 4, 1, 1, 2, 3, 5, 1, 1, 2, 2, 9

Offset: 1

Gus Wiseman, Mar 20 2019

Row n is the multiset of Matula-Goebel numbers of all proper terminal subtrees of the rooted tree with Matula-Goebel number n. For example, the rooted tree with Matula-Goebel number 1362 is (o(o)((oo)(oo))), with proper terminal subtrees {o,o,o,o,o,o,(o),(oo),(oo),((oo)(oo))}, which have Matula-Goebel numbers {1,1,1,1,1,1,2,4,4,49}, which is row 1362, as required.

			Triangle begins:
  {}
  1
  1  2
  1  1
  1  2  3
  1  1  2
  1  1  4
  1  1  1
  1  1  2  2
  1  1  2  3
  1  2  3  5
  1  1  1  2
  1  1  2  6
  1  1  1  4
  1  1  2  2  3
  1  1  1  1
  1  1  4  7
  1  1  1  2  2
  1  1  1  8
  1  1  1  2  3
  1  1  1  2  4
  1  1  2  3  5
  1  1  2  2  9
For example, row 65 is {1,1,1,2,2,3,6} because 65 = q(1)^3 q(2)^2 q(3) q(6).

Cf. A000081, A003963, A061775, A109082, A109129, A112798, A120383, A196050, A317713, A324850, A324922, A324923, A324925, A324931, A324934.

difac[n_]:=If[n==1,{},With[{i=PrimePi[FactorInteger[n][[1,1]]]},Sort[Prepend[difac[n*i/Prime[i]],i]]]];
Table[difac[n],{n,30}]

A324922 a(n) = unique m such that m/A003963(m) = n, where A003963 is product of prime indices.

Original entry on oeis.org

1, 2, 6, 4, 30, 12, 28, 8, 36, 60, 330, 24, 156, 56, 180, 16, 476, 72, 152, 120, 168, 660, 828, 48, 900, 312, 216, 112, 1740, 360, 10230, 32, 1980, 952, 840, 144, 888, 304, 936, 240, 6396, 336, 2408, 1320, 1080, 1656, 8460, 96, 784, 1800, 2856, 624, 848, 432

Offset: 1

Gus Wiseman, Mar 20 2019

Every positive integer has a unique factorization into factors q(i) = prime(i)/i, i > 0 given by the rows of A324924. Then a(n) is the number obtained by encoding this factorization as a standard factorization into prime numbers (A112798).

Rémy Sigrist, Table of n, a(n) for n = 1..10000

Sorting the sequence gives A324850.
Cf. A000081, A003963, A061775, A109129, A112798, A120383, A196050, A317713.
Cf. A324848, A324849, A324923, A324924, A324925, A324931, A324934.

primeMS[n_]:=If[n==1,{},Flatten[Cases[FactorInteger[n],{p_,k_}:>Table[PrimePi[p],{k}]]]];
difac[n_]:=If[n==1,{},With[{m=Product[Prime[i]/i,{i,primeMS[n]}]},Sort[Join[primeMS[n],difac[n/m]]]]];
Table[Times@@Prime/@difac[n],{n,30}]

a(n) = my (f=factor(n)); prod (i=1, #f~, (f[i,1] * a(primepi(f[i,1])))^f[i,2]) \\ Rémy Sigrist, Jul 18 2019

a(n) = Product_t mg(t) where the product is over all (not necessarily distinct) terminal subtrees of the rooted tree with Matula-Goebel number n, and mg(t) is the Matula-Goebel number of t.

Completely multiplicative with a(prime(n)) = prime(n) * a(n). - Rémy Sigrist, Jul 18 2019

Keyword mult added by Rémy Sigrist, Jul 18 2019

A324931 Integers in the list of quotients of positive integers by their product of prime indices.

Original entry on oeis.org

1, 2, 4, 3, 8, 6, 16, 12, 7, 5, 32, 9, 24, 14, 10, 64, 18, 48, 28, 20, 128, 36, 19, 13, 21, 15, 96, 27, 56, 40, 256, 72, 38, 26, 11, 42, 30, 192, 54, 112, 17, 80, 512, 144, 76, 52, 22, 84, 60, 384, 49, 23, 35, 53, 108, 37, 224, 25, 57, 39, 34, 160, 63, 1024

Offset: 1

Gus Wiseman, Mar 21 2019

nonn

These quotients are given by A324932(n)/A324933(n).

This is a permutation of the positive integers, with inverse A324934.

			The sequence of quotients n/A003963(n) begins: 1, 2, 3/2, 4, 5/3, 3, 7/4, 8, 9/4, 10/3, 11/5, 6, 13/6, 7/2, 5/2, 16, ...

Cf. A003963, A109129, A120383, A196050, A324846, A324849, A324850, A324922, A324923, A324924, A324925, A324934.

Select[Table[n/Times@@Cases[If[n==1,{},FactorInteger[n]],{p_,k_}:>PrimePi[p]^k],{n,100}],IntegerQ]

a(n) = A324850(n)/A003963(A324850(n)).

A324925 Number of integer partitions y of n such that Product_{i in y} prime(i)/i is an integer.

Original entry on oeis.org

1, 1, 1, 2, 2, 2, 5, 5, 5, 8, 9, 11, 17, 19, 21, 28, 32, 40, 51, 57, 67, 83, 96, 118, 142, 160, 189, 224, 260, 307, 363, 412, 479, 561, 649, 749, 874, 997, 1141, 1321, 1518, 1734, 1994, 2274, 2582, 2960, 3374, 3837, 4370, 4950, 5604, 6371, 7208, 8157, 9231, 10392

Offset: 0

Gus Wiseman, Mar 20 2019

nonn

The Heinz numbers of these integer partitions are given by A324850.

			The a(1) = 1 through a(8) = 5 integer partitions:
  (1)  (11)  (21)   (211)   (2111)   (321)     (3211)     (32111)
             (111)  (1111)  (11111)  (411)     (4111)     (41111)
                                     (2211)    (22111)    (221111)
                                     (21111)   (211111)   (2111111)
                                     (111111)  (1111111)  (11111111)
For example, (3,2,1,1) is such a partition because (2/1) * (2/1) * (3/2) * (5/3) = 10 is an integer.

Cf. A003963, A109129, A324850, A324922, A324923, A324924, A324931, A324934.

Table[Length[Select[IntegerPartitions[n],IntegerQ[Product[Prime[i]/i,{i,#}]]&]],{n,0,30}]

A324935 Matula-Goebel numbers of rooted trees whose non-leaf terminal subtrees are all different.

Original entry on oeis.org

1, 2, 3, 4, 5, 6, 7, 8, 10, 11, 12, 13, 14, 16, 17, 19, 20, 21, 22, 24, 26, 28, 29, 31, 32, 34, 35, 37, 38, 40, 41, 42, 43, 44, 48, 51, 52, 53, 56, 57, 58, 59, 62, 64, 67, 68, 70, 71, 73, 74, 76, 77, 79, 80, 82, 84, 85, 86, 88, 89, 91, 95, 96, 101, 102, 104

Offset: 1

Gus Wiseman, Mar 21 2019

nonn

Every positive integer has a unique factorization into factors q(i) = prime(i)/i, i > 0. This sequence consists of all numbers where this factorization has all distinct factors, except possibly for any multiplicity of q(1). For example, 22 = q(1)^2 q(2) q(3) q(5) is in the sequence, while 50 = q(1)^3 q(2)^2 q(3)^2 is not.

The enumeration of these trees by number of vertices is A324936.

			The sequence of trees together with their Matula-Goebel numbers begins:
   1: o
   2: (o)
   3: ((o))
   4: (oo)
   5: (((o)))
   6: (o(o))
   7: ((oo))
   8: (ooo)
  10: (o((o)))
  11: ((((o))))
  12: (oo(o))
  13: ((o(o)))
  14: (o(oo))
  16: (oooo)
  17: (((oo)))
  19: ((ooo))
  20: (oo((o)))
  21: ((o)(oo))
  22: (o(((o))))
  24: (ooo(o))
  26: (o(o(o)))
  28: (oo(oo))
  29: ((o((o))))
  31: (((((o)))))

Gus Wiseman, The first 36 rooted trees whose non-leaf terminal subtrees are all different, together with their Matula-Goebel numbers.

Cf. A000081, A004111, A007097, A061775, A196050, A276625, A290822, A317713.

Cf. A324850, A324922, A324923, A324924, A324931, A324934, A324936.

difac[n_]:=If[n==1,{},With[{i=PrimePi[FactorInteger[n][[1,1]]]},Sort[Prepend[difac[n*i/Prime[i]],i]]]];
Select[Range[100],UnsameQ@@DeleteCases[difac[#],1]&]

A325614 Unsorted q-signature of n.

Original entry on oeis.org

1, 1, 1, 2, 1, 1, 1, 2, 1, 2, 1, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 3, 1, 2, 1, 1, 3, 1, 2, 2, 1, 4, 2, 1, 1, 3, 2, 3, 1, 3, 1, 1, 3, 1, 1, 2, 1, 1, 1, 2, 2, 1, 4, 1, 2, 2, 2, 3, 1, 1, 3, 3, 4, 1, 2, 1, 1, 1, 3, 2, 1, 1, 1, 1, 1, 1, 5, 2, 2, 1, 1, 3, 1, 1, 3, 1, 1

Offset: 1

Gus Wiseman, May 12 2019

Every positive integer has a unique q-factorization (encoded by A324924) into factors q(i) = prime(i)/i, i > 0. For example:
   11 = q(1) q(2) q(3) q(5)
   50 = q(1)^3 q(2)^2 q(3)^2
  360 = q(1)^6 q(2)^3 q(3)
Row n lists the nonzero multiplicities in the q-factorization of n, in order of q-index. For example, row 11 is (1,1,1,1) and row 360 is (6,3,1).

			Triangle begins:
  {}
  1
  1 1
  2
  1 1 1
  2 1
  2 1
  3
  2 2
  2 1 1
  1 1 1 1
  3 1
  2 1 1
  3 1
  2 2 1
  4
  2 1 1
  3 2
  3 1
  3 1 1

Row lengths are A324923.
Row sums are A196050.
Row-maxima are A109129.
Cf. A118914, A324922, A324924, A324931, A324934, A325608, A325609, A325613, A325615, A325660.

difac[n_]:=If[n==1,{},With[{i=PrimePi[FactorInteger[n][[1,1]]]},Sort[Prepend[difac[n*i/Prime[i]],i]]]];
Table[Length/@Split[difac[n]],{n,30}]

A325615 Sorted q-signature of n.

Original entry on oeis.org

1, 1, 1, 2, 1, 1, 1, 1, 2, 1, 2, 3, 2, 2, 1, 1, 2, 1, 1, 1, 1, 1, 3, 1, 1, 2, 1, 3, 1, 2, 2, 4, 1, 1, 2, 2, 3, 1, 3, 1, 1, 3, 1, 1, 3, 1, 1, 1, 2, 1, 2, 2, 1, 4, 2, 2, 2, 1, 1, 3, 3, 3, 1, 4, 1, 1, 1, 2, 1, 2, 3, 1, 1, 1, 1, 1, 5, 1, 1, 2, 2, 1, 1, 3, 1, 1, 1

Offset: 1

Gus Wiseman, May 12 2019

Every positive integer has a unique q-factorization (encoded by A324924) into factors q(i) = prime(i)/i, i > 0. For example:
   11 = q(1) q(2) q(3) q(5)
   50 = q(1)^3 q(2)^2 q(3)^2
  360 = q(1)^6 q(2)^3 q(3)
Row n is the multiset of nonzero multiplicities in the q-factorization of n. For example, row 11 is (1,1,1,1) and row 360 is (1,3,6).

			Triangle begins:
  {}
  1
  1 1
  2
  1 1 1
  1 2
  1 2
  3
  2 2
  1 1 2
  1 1 1 1
  1 3
  1 1 2
  1 3
  1 2 2
  4
  1 1 2
  2 3
  1 3
  1 1 3

Row lengths are A324923.
Row sums are A196050.
Row-maxima are A109129.
Cf. A118914, A324922, A324924, A324931, A324934, A325608, A325609, A325613, A325614, A325660.

difac[n_]:=If[n==1,{},With[{i=PrimePi[FactorInteger[n][[1,1]]]},Sort[Prepend[difac[n*i/Prime[i]],i]]]];
Table[Sort[Length/@Split[difac[n]]],{n,30}]

A324933 Denominator in the division of n by the product of prime indices of n.

Original entry on oeis.org

1, 1, 2, 1, 3, 1, 4, 1, 4, 3, 5, 1, 6, 2, 2, 1, 7, 2, 8, 3, 8, 5, 9, 1, 9, 3, 8, 1, 10, 1, 11, 1, 10, 7, 12, 1, 12, 4, 4, 3, 13, 4, 14, 5, 4, 9, 15, 1, 16, 9, 14, 3, 16, 4, 3, 1, 16, 5, 17, 1, 18, 11, 16, 1, 18, 5, 19, 7, 6, 6, 20, 1, 21, 6, 6, 2, 20, 2, 22, 3

Offset: 1

Gus Wiseman, Mar 21 2019

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 sequence of quotients n/A003963(n) begins: 1, 2, 3/2, 4, 5/3, 3, 7/4, 8, 9/4, 10/3, 11/5, 6, 13/6, 7/2, 5/2, 16, ...

Amiram Eldar, Table of n, a(n) for n = 1..10000

The numerators are A324932.

Cf. A003963, A109129, A120383, A196050, A317713, A324846, A324849, A324850, A324922, A324923, A324924, A324925, A324931, A324934.

Table[n/Times@@Cases[If[n==1,{},FactorInteger[n]],{p_,k_}:>PrimePi[p]^k],{n,100}]//Denominator

cp's OEIS Frontend

A324850 Numbers divisible by the product of their prime indices.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

PARI

Formula

A324923 Number of distinct factors in the factorization of n into factors q(i) = prime(i)/i, i > 0.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

PARI

Formula

Extensions

A324924 Irregular triangle read by rows giving the factorization of n into factors q(i) = prime(i)/i, i > 0.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

A324922 a(n) = unique m such that m/A003963(m) = n, where A003963 is product of prime indices.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Mathematica

PARI

Formula

Extensions

A324931 Integers in the list of quotients of positive integers by their product of prime indices.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

Formula

A324925 Number of integer partitions y of n such that Product_{i in y} prime(i)/i is an integer.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

A324935 Matula-Goebel numbers of rooted trees whose non-leaf terminal subtrees are all different.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

A325614 Unsorted q-signature of n.

Views

Author

Keywords