A279789 -id:A279789 - cp's OEIS frontend

A295920 Number of twice-factorizations of n of type (P,R,R).

1, 1, 1, 3, 1, 1, 1, 3, 3, 1, 1, 1, 1, 1, 1, 8, 1, 1, 1, 1, 1, 1, 1, 1, 3, 1, 3, 1, 1, 1, 1, 3, 1, 1, 1, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 3, 1, 1, 1, 1, 1

Offset: 1

Gus Wiseman, Nov 30 2017

nonn

a(n) is also the number of ways to choose a perfect divisor d|n and then a sequence of log_d(n) perfect divisors of d.

			The a(64) = 17 twice-factorizations are:
(2)*(2)*(2)*(2)*(2)*(2)  (2*2)*(2*2)*(2*2)  (2*2*2)*(2*2*2)  (2*2*2*2*2*2)
(2*2)*(2*2)*(4)          (2*2)*(4)*(2*2)    (4)*(2*2)*(2*2)
(2*2)*(4)*(4)            (4)*(2*2)*(4)      (4)*(4)*(2*2)
(2*2*2)*(8)              (8)*(2*2*2)
(4)*(4)*(4)              (4*4*4)
(8)*(8)                  (8*8)
(64)

Antti Karttunen, Table of n, a(n) for n = 1..16384
Index entries for sequences computed from exponents in factorization of n

Cf. A000005, A001055, A052409, A052410, A089723, A279789, A281113, A295923, A295924, A295931, A295935.

Table[Sum[Length[Divisors[GCD@@FactorInteger[n^(1/d)][[All,2]]]]^d,{d,Divisors[GCD@@FactorInteger[n][[All,2]]]}],{n,100}]

A052409(n) = { my(k=ispower(n)); if(k, k, n>1); }; \\ From A052409
A295920(n) = if(1==n,n,my(r); sumdiv(A052409(n), d, if(!ispower(n,d,&r),(1/0),numdiv(A052409(r))^d))); \\ Antti Karttunen, Dec 06 2018, after Mathematica-code

a(n) = Sum_{d|A052409(n)} A000005(A052409(n^(1/d)))^d. - Antti Karttunen, Dec 06 2018, after Mathematica-code

More terms from Antti Karttunen, Dec 06 2018

A382215 MM-numbers of multiset partitions into constant blocks with a common sum.

Original entry on oeis.org

1, 2, 3, 4, 5, 7, 8, 9, 11, 16, 17, 19, 23, 25, 27, 31, 32, 35, 41, 49, 53, 59, 64, 67, 81, 83, 97, 103, 109, 121, 125, 127, 128, 131, 157, 175, 179, 191, 209, 211, 227, 241, 243, 245, 256, 277, 283, 289, 311, 331, 343, 353, 361, 367, 391, 401, 419, 431, 461

Offset: 1

Gus Wiseman, Mar 21 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, sum A056239. The multiset of multisets with MM-number n is formed by taking the multiset of prime indices of each part of the multiset of prime indices of n. For example, the prime indices of 78 are {1,2,6}, so the multiset of multisets with MM-number 78 is {{},{1},{1,2}}.

			The terms together with their prime indices of prime indices begin:
   1: {}
   2: {{}}
   3: {{1}}
   4: {{},{}}
   5: {{2}}
   7: {{1,1}}
   8: {{},{},{}}
   9: {{1},{1}}
  11: {{3}}
  16: {{},{},{},{}}
  17: {{4}}
  19: {{1,1,1}}
  23: {{2,2}}
  25: {{2},{2}}
  27: {{1},{1},{1}}
  31: {{5}}
  32: {{},{},{},{},{}}
  35: {{2},{1,1}}
  41: {{6}}
  49: {{1,1},{1,1}}
  53: {{1,1,1,1}}
  59: {{7}}

Twice-partitions of this type are counted by A279789.
For just constant blocks we have A302492, counted by A000688.
For sets of constant multisets we have A302496, counted by A050361.
For just common sums we have A326534, counted by A321455.
Factorizations of this type are counted by A381995.
For strict blocks and distinct sums we have A382201, counted by A381633.
Normal multiset partitions of this type are counted by A382204.
For strict instead of constant blocks we have A382304, counted by A382080.
For sets of constant multisets with distinct sums A382426, counted by A381635.
A055396 gives least prime index, greatest A061395.
A056239 adds up prime indices, row sums of A112798.
A124010 gives prime signature, sorted A118914, length A001221, sum A001222.
Cf. A000720, A000961, A001055, A302242, A302601, A368100, A381715, A381716, A381636, A381871.

prix[n_]:=If[n==1,{},Flatten[Cases[FactorInteger[n], {p_,k_}:>Table[PrimePi[p],{k}]]]];
Select[Range[100],SameQ@@Total/@prix/@prix[#] && And@@SameQ@@@prix/@prix[#]&]

is(k) = my(f=factor(k)[, 1]~, k, p, v=vector(#f, i, primepi(f[i]))); for(i=1, #v, k=isprimepower(v[i], &p); if(k||v[i]==1, v[i]=k*primepi(p), return(0))); #Set(v)<2; \\ Jinyuan Wang, Apr 02 2025

Equals A326534 /\ A302492.

A343938 Twice the number of prime factors of n minus the sum of prime indices of n, both counted with multiplicity.

Original entry on oeis.org

0, 1, 0, 2, -1, 1, -2, 3, 0, 0, -3, 2, -4, -1, -1, 4, -5, 1, -6, 1, -2, -2, -7, 3, -2, -3, 0, 0, -8, 0, -9, 5, -3, -4, -3, 2, -10, -5, -4, 2, -11, -1, -12, -1, -1, -6, -13, 4, -4, -1, -5, -2, -14, 1, -4, 1, -6, -7, -15, 1, -16, -8, -2, 6, -5, -2, -17, -3, -7

Offset: 1

Gus Wiseman, Aug 04 2021

sign

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.

			For n = 1050 we have 5 prime indices {1,2,3,3,4}, so a(1050) = 10 - 13 = -3.

First appearances are the elements of A174090 except for 3.
Positions of zeros are A340387.
Positions of nonpositive terms are A344291.
Positions of nonnegative terms are A344296.
A001222 counts prime indices.
A056239 adds up prime indices.
A112798 lists prime indices.
Cf. A001221, A003963, A061775, A275024, A279789, A299757, A302242.

Table[2*PrimeOmega[n]-Total[Cases[FactorInteger[n],{p_,k_}:>k*PrimePi[p]]],{n,100}]

Totally additive with a(prime(k)) = 2 - k.

A383093 Number of integer partitions of n that can be partitioned into constant blocks with a common sum.

Original entry on oeis.org

1, 1, 2, 2, 4, 2, 7, 2, 9, 5, 9, 2, 23, 2, 11, 10, 24, 2, 33, 2, 36, 12, 15, 2, 87, 7, 17, 17, 53, 2, 96, 2, 79, 16, 21, 14, 196, 2, 23, 18, 154, 2, 166, 2, 99, 54, 27, 2, 431, 9, 85, 22, 128, 2, 303, 18, 261, 24, 33, 2, 771, 2, 35, 73, 331, 20, 422, 2, 198, 28, 216, 2, 1369

Offset: 0

Gus Wiseman, Apr 22 2025

nonn

			The partition (4,4,2,2,2,2,1,1,1,1,1,1,1,1) has two partitions into constant blocks with a common sum: {{4,4},{2,2,2,2},{1,1,1,1,1,1,1,1}} and {{4},{4},{2,2},{2,2},{1,1,1,1},{1,1,1,1}}, so is counted under a(24).
The a(1) = 1 through a(8) = 9 partitions:
  (1)  (2)   (3)    (4)     (5)      (6)       (7)        (8)
       (11)  (111)  (22)    (11111)  (33)      (1111111)  (44)
                    (211)            (222)                (422)
                    (1111)           (2211)               (2222)
                                     (3111)               (22211)
                                     (21111)              (41111)
                                     (111111)             (221111)
                                                          (2111111)
                                                          (11111111)

Twice-partitions of this type (constant with common) are counted by A279789.
Multiset partitions of this type are ranked by A383309.
The complement is counted by A381993, ranks A381871.
For sets we have the complement of A381994, see A381719, A382080.
Normal multiset partitions of this type are counted by A382203, sets A381718.
For distinct instead of equal block-sums we have A382427.
These partitions are ranked by A383014, nonzeros of A381995.
A000041 counts integer partitions, strict A000009.
A000688 counts factorizations into prime powers, see A381455, A381453.
A001055 counts factorizations, strict A045778, see A317141, A300383, A265947.
A050361 counts factorizations into distinct prime powers, see A381715.
A323774 counts partitions into constant blocks with a common sum
Constant blocks with distinct sums: A381635, A381636, A381717.
Permutation with equal run-sums: A383096, A383098, A383100, A383110
Cf. A006171, A047966, A279784, A295935, A323774, A326534, A353864, A355743, A381716, A382076, A382204.

mce[y_]:=Table[ConstantArray[y[[1]],#]&/@ptn,{ptn,IntegerPartitions[Length[y]]}];
Table[Length[Select[IntegerPartitions[n],Length[Select[Join@@@Tuples[mce/@Split[#]],SameQ@@Total/@#&]]>0&]],{n,0,30}]

Multiset systems of this type have MM-numbers A383309 = A326534 /\ A355743.

Conjecture: We have Sum_{d|n} a(d) = A323774(n), so this is the Moebius transform of A323774.

More terms from Jakub Buczak, May 03 2025

A302498 Numbers that are a power of a prime number whose prime index is itself a power of a prime number.

Original entry on oeis.org

1, 2, 3, 4, 5, 7, 8, 9, 11, 16, 17, 19, 23, 25, 27, 31, 32, 41, 49, 53, 59, 64, 67, 81, 83, 97, 103, 109, 121, 125, 127, 128, 131, 157, 179, 191, 211, 227, 241, 243, 256, 277, 283, 289, 311, 331, 343, 353, 361, 367, 401, 419, 431, 461, 509, 512, 529, 547, 563

Offset: 1

Gus Wiseman, Apr 09 2018

nonn

A prime index of n is a number m such that prime(m) divides n.

			49 is in the sequence because 49 = prime(prime(1)^2)^2.
Entry A302242 describes a correspondence between positive integers and multiset multisystems. In this case it gives the following sequence of constant constant-multiset multisystems.
01: {}
02: {{}}
03: {{1}}
04: {{},{}}
05: {{2}}
07: {{1,1}}
08: {{},{},{}}
09: {{1},{1}}
11: {{3}}
16: {{},{},{},{}}
17: {{4}}
19: {{1,1,1}}
23: {{2,2}}
25: {{2},{2}}
27: {{1},{1},{1}}
31: {{5}}
32: {{},{},{},{},{}}
41: {{6}}
49: {{1,1},{1,1}}
53: {{1,1,1,1}}
59: {{7}}
64: {{},{},{},{},{},{}}

Andrew Howroyd, Table of n, a(n) for n = 1..1000

Cf. A000961, A001222, A003963, A005117, A007716, A056239, A076610, A275024, A279789, A295920, A301763, A302242, A302243, A302492, A302493, A302496, A302497.

Select[Range[100],Or[#===1,PrimePowerQ[#]&&And@@(Or[#===1,PrimePowerQ[#]]&/@PrimePi/@FactorInteger[#][[All,1]])]&]

ok(n)={my(p); n == 1 || (isprimepower(n, &p) && (p == 2 || isprimepower(primepi(p))))} \\ Andrew Howroyd, Aug 26 2018

A323776 a(n) = Sum_{k = 1...n} binomial(k + 2^(n - k) - 1, k - 1).

Original entry on oeis.org

1, 3, 7, 16, 40, 119, 450, 2253, 15207, 139190, 1731703, 29335875, 677864041, 21400069232, 924419728471, 54716596051100, 4443400439075834, 495676372493566749, 76041424515817042402, 16060385520094706930608, 4674665948889147697184915

Offset: 1

Gus Wiseman, Jan 27 2019

nonn

Number of multiset partitions of integer partitions of 2^(n - 1) whose parts are constant and have equal sums.

			The a(1) = 1 through a(4) = 16 partitions of partitions:
  (1)  (2)     (4)           (8)
       (11)    (22)          (44)
       (1)(1)  (1111)        (2222)
               (2)(2)        (4)(4)
               (2)(11)       (4)(22)
               (11)(11)      (22)(22)
               (1)(1)(1)(1)  (4)(1111)
                             (11111111)
                             (22)(1111)
                             (1111)(1111)
                             (2)(2)(2)(2)
                             (2)(2)(2)(11)
                             (2)(2)(11)(11)
                             (2)(11)(11)(11)
                             (11)(11)(11)(11)
                             (1)(1)(1)(1)(1)(1)(1)(1)

Seiichi Manyama, Table of n, a(n) for n = 1..120

Cf. A000123, A001970, A002577, A006171, A007716, A034729, A047968, A279787, A279789, A305551, A306017, A319056, A323766, A323774, A323775.

Table[Sum[Binomial[k+2^(n-k)-1,k-1],{k,n}],{n,20}]

a(n) = sum(k=1, n, binomial(k+2^(n-k)-1, k-1)); \\ Michel Marcus, Jan 28 2019

A344080 a(n) = Sum_{d|n} tau(d)^n, where tau(n) is the number of divisors of n.

Original entry on oeis.org

1, 5, 9, 98, 33, 4225, 129, 72354, 20196, 1050625, 2049, 2194099186, 8193, 268468225, 1073807361, 156925970179, 131073, 101629064089930, 524289, 3657261440572306, 4398050705409, 17592194433025, 8388609, 4727105427440383342818, 847322163876, 4503599761588225

Offset: 1

Seiichi Manyama, May 09 2021

nonn

Seiichi Manyama, Table of n, a(n) for n = 1..719

Cf. A007425, A062367, A097988, A279789, A344060, A344081.

a[n_] := DivisorSum[n, DivisorSigma[0, #]^n &]; Array[a, 26] (* Amiram Eldar, May 09 2021 *)

PARI
```
a(n) = sumdiv(n, d, numdiv(d)^n);
```

my(N=40, x='x+O('x^N)); Vec(sum(k=1, N, (numdiv(k)*x)^k/(1-(numdiv(k)*x)^k)))

G.f.: Sum_{k >= 1} (tau(k) * x)^k/(1 - (tau(k) * x)^k).

If p is prime, a(p) = 1 + 2^p.

A344081 a(n) = Sum_{d|n} tau(d)^d, where tau(n) is the number of divisors of n.

Original entry on oeis.org

1, 5, 9, 86, 33, 4109, 129, 65622, 19692, 1048613, 2049, 2176786526, 8193, 268435589, 1073741865, 152587956247, 131073, 101559956692208, 524289, 3656158441111670, 4398046511241, 17592186046469, 8388609, 4722366482871822065758

Offset: 1

Seiichi Manyama, May 09 2021

nonn

Seiichi Manyama, Table of n, a(n) for n = 1..719

Cf. A007425, A062367, A097988, A279789, A344047, A344080.

a[n_] := DivisorSum[n, DivisorSigma[0, #]^# &]; Array[a, 24] (* Amiram Eldar, May 09 2021 *)

PARI
```
a(n) = sumdiv(n, d, numdiv(d)^d);
```

my(N=40, x='x+O('x^N)); Vec(sum(k=1, N, (numdiv(k)*x)^k/(1-x^k)))

G.f.: Sum_{k >= 1} (tau(k) * x)^k/(1 - x^k).

If p is prime, a(p) = 1 + 2^p.

A382524 Number of ways to choose a different constant partition of each part of a constant partition of n.

Original entry on oeis.org

1, 1, 2, 2, 5, 2, 6, 2, 10, 3, 6, 2, 24, 2, 6, 4, 17, 2, 36, 2, 18, 4, 6, 2, 86, 3, 6, 10, 18, 2, 44, 2, 50, 4, 6, 4, 159, 2, 6, 4, 62, 2, 44, 2, 18, 30, 6, 2, 486, 3, 12, 4, 18, 2, 140, 4, 62, 4, 6, 2, 932, 2, 6, 30, 157, 4, 44, 2, 18, 4, 20, 2, 1500, 2, 6

Offset: 0

Gus Wiseman, Apr 03 2025

nonn

These are strict twice-partitions of weight n and type PRR.

			The a(1) = 1 through a(8) = 10 twice-partitions:
  (1)  (2)   (3)    (4)      (5)      (6)       (7)        (8)
       (11)  (111)  (22)     (11111)  (33)      (1111111)  (44)
                    (1111)            (222)                (2222)
                    (11)(2)           (111111)             (22)(4)
                    (2)(11)           (111)(3)             (4)(22)
                                      (3)(111)             (1111)(4)
                                                           (4)(1111)
                                                           (11111111)
                                                           (1111)(22)
                                                           (22)(1111)

Gus Wiseman, Sequences enumerating triangles of integer partitions

For distinct instead of equal block-sums we have A279786.
This is the strict case of A279789.
The orderless version is A304442, see A353833, A381995, A381871.
Multiset partitions of this type are ranked by A326534 /\ A355743 /\ A005117.
Partitions with no partition of this type are counted by A382076, strict case of A381993.
Normal multiset partitions of this type are counted by the strict case of A382204.
A006171 counts multiset partitions into constant blocks of integer partitions of n.
A050361 counts factorizations into distinct prime powers, see A381715.
A317141 counts coarsenings of prime indices, refinements A300383.
Cf. A000005, A000040, A000688, A018818, A047966, A063834, A260685, A279784, A356065, A381453, A381455.

Table[If[n==0,1,Sum[Binomial[Length[Divisors[n/d]],d]*d!,{d,Divisors[n]}]],{n,0,100}]

a(n) = Sum_{d|n} binomial(A000005(n/d),d) * d!

A323775 a(n) = Sum_{k = 1...n} k^(2^(n - k)).

Original entry on oeis.org

1, 3, 8, 30, 359, 72385, 4338080222, 18448597098193762732, 340282370354622283774333836315916425069, 115792089237316207213755562747271079374483128445080168204415615259394085515423

Offset: 1

Gus Wiseman, Jan 27 2019

nonn

Number of ways to choose a constant integer partition of each part of a constant integer partition of 2^(n - 1).

			The a(1) = 1 through a(4) = 30 twice-partitions:
  (1)  (2)     (4)           (8)
       (11)    (22)          (44)
       (1)(1)  (1111)        (2222)
               (2)(2)        (4)(4)
               (11)(2)       (22)(4)
               (2)(11)       (4)(22)
               (11)(11)      (22)(22)
               (1)(1)(1)(1)  (1111)(4)
                             (4)(1111)
                             (11111111)
                             (1111)(22)
                             (22)(1111)
                             (1111)(1111)
                             (2)(2)(2)(2)
                             (11)(2)(2)(2)
                             (2)(11)(2)(2)
                             (2)(2)(11)(2)
                             (2)(2)(2)(11)
                             (11)(11)(2)(2)
                             (11)(2)(11)(2)
                             (11)(2)(2)(11)
                             (2)(11)(11)(2)
                             (2)(11)(2)(11)
                             (2)(2)(11)(11)
                             (11)(11)(11)(2)
                             (11)(11)(2)(11)
                             (11)(2)(11)(11)
                             (2)(11)(11)(11)
                             (11)(11)(11)(11)
                             (1)(1)(1)(1)(1)(1)(1)(1)

Cf. A000123, A001970, A002577, A006171, A279787, A279789, A305551, A306017, A319056, A323766, A323774, A323776.

Mathematica
```
Table[Sum[k^2^(n-k),{k,n}],{n,12}]
```

cp's OEIS Frontend

A295920 Number of twice-factorizations of n of type (P,R,R).

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

PARI

Formula

Extensions

A382215 MM-numbers of multiset partitions into constant blocks with a common sum.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

PARI

Formula

A343938 Twice the number of prime factors of n minus the sum of prime indices of n, both counted with multiplicity.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

Formula

A383093 Number of integer partitions of n that can be partitioned into constant blocks with a common sum.

Views

Author

Keywords

Examples

Crossrefs

Programs

Mathematica

Formula

Extensions

A302498 Numbers that are a power of a prime number whose prime index is itself a power of a prime number.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

PARI

A323776 a(n) = Sum_{k = 1...n} binomial(k + 2^(n - k) - 1, k - 1).

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

PARI

A344080 a(n) = Sum_{d|n} tau(d)^n, where tau(n) is the number of divisors of n.

Views

Author

Keywords

Links

Crossrefs

Programs

Mathematica

PARI

PARI

Formula

A344081 a(n) = Sum_{d|n} tau(d)^d, where tau(n) is the number of divisors of n.

Views