A340851 -id:A340851 - cp's OEIS frontend

A168659 Number of partitions of n such that the number of parts is divisible by the greatest part. Also number of partitions of n such that the greatest part is divisible by the number of parts.

1, 1, 2, 2, 3, 3, 6, 6, 8, 9, 14, 16, 22, 25, 33, 39, 51, 60, 79, 92, 116, 137, 174, 204, 254, 300, 368, 435, 530, 625, 760, 896, 1076, 1267, 1518, 1780, 2121, 2484, 2946, 3444, 4070, 4749, 5594, 6514, 7637, 8879, 10384, 12043, 14040, 16255

Offset: 1

Vladeta Jovovic, Dec 02 2009

nonn

			a(5)=3 because in the partitions [1,1,1,1,1], [1,1,1,2], [1,1,3] the number of parts is divisible by the greatest part; not true for the partitions [1,2,2],[2,3], [1,4], and [5]. - _Emeric Deutsch_, Dec 04 2009
From _Gus Wiseman_, Feb 08 2021: (Start)
The a(1) = 1 through a(10) = 9 partitions of the first type:
  1  11  21   22    311    321     322      332       333        4222
         111  1111  2111   2211    331      2222      4221       4321
                    11111  111111  2221     4211      4311       4411
                                   4111     221111    51111      52111
                                   211111   311111    222111     222211
                                   1111111  11111111  321111     322111
                                                      21111111   331111
                                                      111111111  22111111
                                                                 1111111111
The a(1) = 1 through a(11) = 14 partitions of the second type (A=10, B=11):
  1   2   3    4    5     6     7      8      9       A       B
          21   22   41    42    43     44     63      64      65
                    311   321   61     62     81      82      83
                                322    332    333     622     A1
                                331    611    621     631     632
                                4111   4211   4221    4222    641
                                              4311    4321    911
                                              51111   4411    4322
                                                      52111   4331
                                                              4421
                                                              8111
                                                              52211
                                                              53111
                                                              611111
(End)

Vaclav Kotesovec, Table of n, a(n) for n = 1..5000 (terms 1..301 from Vladeta Jovovic corrected by N. J. A. Sloane, Oct 05 2010, terms 302..1000 from Seiichi Manyama)

Cf. A168656, A168657, A079501, A168655.
Note: A-numbers of Heinz-number sequences are in parentheses below.
The case of equality is A047993 (A106529).
The Heinz numbers of these partitions are A340609/A340610.
If all parts (not just the greatest) are divisors we get A340693 (A340606).
The strict case in the second interpretation is A340828 (A340856).
A006141 = partitions whose length equals their minimum (A324522).
A067538 = partitions whose length/max divides their sum (A316413/A326836).
A200750 = partitions with length coprime to maximum (A340608).
Cf. A003114, A039900, A064173, A064174, A143773, A326837, A340653, A340830, A340851, A340853.
Row sums of A350879.

a := proc (n) local pn, ct, j: with(combinat): pn := partition(n): ct := 0: for j to numbpart(n) do if `mod`(nops(pn[j]), max(seq(pn[j][i], i = 1 .. nops(pn[j])))) = 0 then ct := ct+1 else end if end do: ct end proc: seq(a(n), n = 1 .. 50); # Emeric Deutsch, Dec 04 2009

Table[Length[Select[IntegerPartitions[n],Divisible[Length[#],Max[#]]&]],{n,30}] (* Gus Wiseman, Feb 08 2021 *)
nmax = 100; s = 0; Do[s += Normal[Series[Sum[x^((m+1)*k - 1) * Product[(1 - x^(m*k + j - 1))/(1 - x^j), {j, 1, k-1}], {k, 1, (1 + nmax)/(1 + m) + 1}], {x, 0, nmax}]], {m, 1, nmax}]; Rest[CoefficientList[s, x]] (* Vaclav Kotesovec, Oct 18 2024 *)

G.f.: Sum_{i>=1} Sum_{j>=1} x^((i+1)*j-1) * Product_{k=1..j-1} (1-x^(i*j+k-1))/(1-x^k). - Seiichi Manyama, Jan 24 2022

a(n) ~ c * exp(Pi*sqrt(2*n/3)) / n^(3/2), where c = 0.04628003... - Vaclav Kotesovec, Nov 16 2024

Extended by Emeric Deutsch, Dec 04 2009

A340785 Number of factorizations of 2n into even factors > 1.

Original entry on oeis.org

1, 2, 1, 3, 1, 2, 1, 5, 1, 2, 1, 4, 1, 2, 1, 7, 1, 3, 1, 4, 1, 2, 1, 7, 1, 2, 1, 4, 1, 3, 1, 11, 1, 2, 1, 6, 1, 2, 1, 7, 1, 3, 1, 4, 1, 2, 1, 12, 1, 3, 1, 4, 1, 3, 1, 7, 1, 2, 1, 7, 1, 2, 1, 15, 1, 3, 1, 4, 1, 3, 1, 12, 1, 2, 1, 4, 1, 3, 1, 12, 1, 2, 1, 7, 1

Offset: 1

Gus Wiseman, Jan 30 2021

nonn

			The a(n) factorizations for n = 2*2, 2*4, 2*8, 2*12, 2*16, 2*32, 2*36, 2*48 are:
  4    8      16       24     32         64           72      96
  2*2  2*4    2*8      4*6    4*8        8*8          2*36    2*48
       2*2*2  4*4      2*12   2*16       2*32         4*18    4*24
              2*2*4    2*2*6  2*2*8      4*16         6*12    6*16
              2*2*2*2         2*4*4      2*4*8        2*6*6   8*12
                              2*2*2*4    4*4*4        2*2*18  2*6*8
                              2*2*2*2*2  2*2*16               4*4*6
                                         2*2*2*8              2*2*24
                                         2*2*4*4              2*4*12
                                         2*2*2*2*4            2*2*4*6
                                         2*2*2*2*2*2          2*2*2*12
                                                              2*2*2*2*6

Antti Karttunen, Table of n, a(n) for n = 1..20000

Note: A-numbers of Heinz-number sequences are in parentheses below.
The version for partitions is A035363 (A066207).
The odd version is A340101.
The even length case is A340786.
- Factorizations -
A001055 counts factorizations, with strict case A045778.
A340653 counts balanced factorizations.
A340831/A340832 count factorizations with odd maximum/minimum.
A316439 counts factorizations by product and length
A340102 counts odd-length factorizations of odd numbers into odd factors.
- Even -
A027187 counts partitions of even length/maximum (A028260/A244990).
A058696 counts partitions of even numbers (A300061).
A067661 counts strict partitions of even length (A030229).
A236913 counts partitions of even length and sum.
A340601 counts partitions of even rank (A340602).
Cf. A001147, A001222, A050320, A066208, A160786, A174725, A320655, A320656, A339890, A340851.
Even bisection of A349906.

facs[n_]:=If[n<=1,{{}},Join@@Table[Map[Prepend[#,d]&,Select[facs[n/d],Min@@#>=d&]],{d,Rest[Divisors[n]]}]];
Table[Length[Select[facs[n],Select[#,OddQ]=={}&]],{n,2,100,2}]

A349906(n, m=n) = if(1==n, 1, my(s=0); fordiv(n, d, if((d>1)&&(d<=m)&&!(d%2), s += A349906(n/d, d))); (s));
A340785(n) = A349906(2*n); \\ Antti Karttunen, Dec 13 2021

a(n) = A349906(2*n). - Antti Karttunen, Dec 13 2021

A340852 Numbers that can be factored in such a way that every factor is a divisor of the number of factors.

Original entry on oeis.org

1, 4, 16, 27, 32, 64, 96, 128, 144, 192, 216, 256, 288, 324, 432, 486, 512, 576, 648, 729, 864, 972, 1024, 1296, 1458, 1728, 1944, 2048, 2560, 2592, 2916, 3125, 3888, 4096, 5120, 5184, 5832, 6144, 6400, 7776, 8192, 9216, 11664, 12288, 12800, 13824, 15552

Offset: 1

Gus Wiseman, Feb 04 2021

nonn

Also numbers that can be factored in such a way that the length is divisible by the least common multiple.

			The sequence of terms together with their prime indices begins:
    1: {}
    4: {1,1}
   16: {1,1,1,1}
   27: {2,2,2}
   32: {1,1,1,1,1}
   64: {1,1,1,1,1,1}
   96: {1,1,1,1,1,2}
  128: {1,1,1,1,1,1,1}
  144: {1,1,1,1,2,2}
  192: {1,1,1,1,1,1,2}
  216: {1,1,1,2,2,2}
  256: {1,1,1,1,1,1,1,1}
  288: {1,1,1,1,1,2,2}
  324: {1,1,2,2,2,2}
  432: {1,1,1,1,2,2,2}
For example, 24576 has three suitable factorizations:
  (2*2*2*2*2*2*2*2*2*2*2*12)
  (2*2*2*2*2*2*2*2*2*2*4*6)
  (2*2*2*2*2*2*2*2*2*3*4*4)
so is in the sequence.

Partitions of this type are counted by A340693 (A340606).
These factorizations are counted by A340851.
The reciprocal version is A340853.
A143773 counts partitions whose parts are multiples of the number of parts.
A320911 can be factored into squarefree semiprimes.
A340597 have an alt-balanced factorization.
A340656 lack a twice-balanced factorization, complement A340657.
- Factorizations -
A001055 counts factorizations, with strict case A045778.
A316439 counts factorizations by product and length.
A339846 counts factorizations of even length.
A339890 counts factorizations of odd length.
A340101 counts factorizations into odd factors, odd-length case A340102.
A340653 counts balanced factorizations.
A340831/A340832 count factorizations with odd maximum/minimum.
A340785 counts factorizations into even numbers, even-length case A340786.
A340854 cannot be factored with odd least factor, complement A340855.
Cf. A050320, A067538, A168659, A301987, A316413, A327517, A340596, A340599, A340609, A340654, A340655, A340827, A340830.

facs[n_]:=If[n<=1,{{}},Join@@Table[Map[Prepend[#,d]&,Select[facs[n/d],Min@@#>=d&]],{d,Rest[Divisors[n]]}]];
Select[Range[1000],Select[facs[#],And@@IntegerQ/@(Length[#]/#)&]!={}&]

A340830 Number of strict integer partitions of n such that every part is a multiple of the number of parts.

Original entry on oeis.org

1, 1, 1, 1, 1, 2, 1, 2, 1, 3, 1, 3, 1, 4, 1, 4, 1, 6, 1, 5, 2, 6, 1, 8, 1, 7, 4, 7, 1, 12, 1, 8, 6, 9, 1, 16, 1, 10, 9, 11, 1, 21, 1, 12, 13, 12, 1, 28, 1, 13, 17, 16, 1, 33, 1, 19, 22, 15, 1, 45, 1, 16, 28, 25, 1, 47, 1, 28, 34, 18

Offset: 1

Gus Wiseman, Feb 02 2021

nonn

			The a(n) partitions for n = 1, 6, 10, 14, 18, 20, 24, 26, 30:
  1   6     10    14     18      20     24       26      30
      4,2   6,4   8,6    10,8    12,8   16,8     18,8    22,8
            8,2   10,4   12,6    14,6   18,6     20,6    24,6
                  12,2   14,4    16,4   20,4     22,4    26,4
                         16,2    18,2   22,2     24,2    28,2
                         9,6,3          14,10    14,12   16,14
                                        12,9,3   16,10   18,12
                                        15,6,3           20,10
                                                         15,9,6
                                                         18,9,3
                                                         21,6,3
                                                         15,12,3

Note: A-numbers of Heinz-number sequences are in parentheses below.
The non-strict case is A143773 (A316428).
The case where length divides sum also is A340827.
The version for factorizations is A340851.
Factorization of this type are counted by A340853.
A018818 counts partitions into divisors (A326841).
A047993 counts balanced partitions (A106529).
A067538 counts partitions whose length/max divide sum (A316413/A326836).
A072233 counts partitions by sum and length, with strict case A008289.
A102627 counts strict partitions whose length divides sum.
A326850 counts strict partitions whose maximum part divides sum.
A326851 counts strict partitions with length and maximum dividing sum.
A340828 counts strict partitions with length divisible by maximum.
A340829 counts strict partitions with Heinz number divisible by sum.
Cf. A114638, A168659, A326641, A326843 (A326837), A326849, A326852 (A326838), A330950 (A324851), A340852.

Table[Length[Select[IntegerPartitions[n],UnsameQ@@#&&And@@IntegerQ/@(#/Length[#])&]],{n,30}]

a(n) = Sum_{d|n} A008289(n/d, d).

A340827 Number of strict integer partitions of n into divisors of n whose length also divides n.

Original entry on oeis.org

1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 3, 1, 1, 1, 1, 1, 2, 1, 2, 1, 1, 1, 5, 1, 1, 1, 1, 1, 3, 1, 1, 1, 1, 1, 5, 1, 1, 1, 3, 1, 2, 1, 1, 1, 1, 1, 6, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 25, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 18, 1, 1, 1, 1, 1, 2, 1, 3, 1, 1, 1, 17, 1, 1, 1, 1, 1, 14, 1, 1, 1, 1, 1, 12, 1, 1, 1, 3, 1, 2, 1, 1, 1

Offset: 1

Gus Wiseman, Feb 01 2021

nonn

The first element not in A326715 that is however a Heinz number of these partitions is 273.

			The a(n) partitions for n = 6, 12, 24, 90, 84:
  6       12        24            90                      84
  3,2,1   6,4,2     12,8,4        45,30,15                42,28,14
          6,3,2,1   12,6,4,2      45,30,9,5,1             42,21,14,7
                    12,8,3,1      45,18,15,9,3            42,28,12,2
                    8,6,4,3,2,1   45,30,10,3,2            42,28,6,4,3,1
                                  45,18,15,10,2           42,28,7,4,2,1
                                  45,30,6,5,3,1           42,14,12,7,6,3
                                  45,30,9,3,2,1           42,21,12,4,3,2
                                  45,15,10,9,6,5          42,21,12,6,2,1
                                  45,18,10,9,5,3          42,21,14,4,2,1
                                  45,18,10,9,6,2          28,21,14,12,6,3
                                  45,18,15,6,5,1          28,21,14,12,7,2
                                  45,18,15,9,2,1          42,21,7,6,4,3,1
                                  30,18,15,10,6,5,3,2,1   42,14,12,7,4,3,2
                                                          42,14,12,7,6,2,1
                                                          28,21,14,12,4,3,2
                                                          28,21,14,12,6,2,1

David A. Corneth, Table of n, a(n) for n = 1..10000 (first 2519 terms from Antti Karttunen)
Antti Karttunen, Scheme program for computing this sequence

Note: A-numbers of Heinz-number sequences are in parentheses below.
The non-strict case is A326842 (A326847).
A018818 = partitions using divisors (A326841).
A047993 = balanced partitions (A106529).
A067538 = partitions whose length/maximum divides sum (A316413/A326836).
A072233 = partitions by sum and length, with strict case A008289.
A102627 = strict partitions whose length divides sum.
A326850 = strict partitions whose maximum part divides sum.
A326851 = strict partitions w/ length and max dividing sum.
A340828 = strict partitions w/ length divisible by max.
A340829 = strict partitions w/ Heinz number divisible by sum.
A340830 = strict partitions w/ parts divisible by length.
Cf. A064173, A143773 (A316428), A168659, A326843 (A326837), A326852, A330950 (A324851), A340851, A340853.

Table[Length[Select[IntegerPartitions[n,All,Divisors[n]],UnsameQ@@#&&Divisible[n,Length[#]]&]],{n,30}]

A340827(n, divsleft=List(divisors(n)), rest=n, len=0) = if(rest<=0, !rest && !(n%len), my(s=0, d); forstep(i=#divsleft, 1, -1, d = divsleft[i]; listpop(divsleft,i); if(rest>=d, s += A340827(n, divsleft, rest-d, 1+len))); (s)); \\ Antti Karttunen, Feb 22 2023

;; See the Links-section. - Antti Karttunen, Feb 22 2023

Data section extended up to a(105) by Antti Karttunen, Feb 22 2023

A340786 Number of factorizations of 4n into an even number of even factors > 1.

Original entry on oeis.org

1, 1, 1, 3, 1, 2, 1, 3, 2, 2, 1, 4, 1, 2, 2, 6, 1, 3, 1, 4, 2, 2, 1, 6, 2, 2, 2, 4, 1, 4, 1, 7, 2, 2, 2, 7, 1, 2, 2, 6, 1, 4, 1, 4, 3, 2, 1, 10, 2, 3, 2, 4, 1, 4, 2, 6, 2, 2, 1, 8, 1, 2, 3, 12, 2, 4, 1, 4, 2, 4, 1, 10, 1, 2, 3, 4, 2, 4, 1, 10, 3, 2, 1, 8, 2, 2

Offset: 1

Gus Wiseman, Jan 31 2021

nonn

			The a(n) factorizations for n = 6, 12, 24, 36, 60, 80, 500:
  4*6   6*8      2*48      2*72      4*60      4*80          40*50
  2*12  2*24     4*24      4*36      6*40      8*40          4*500
        4*12     6*16      6*24      8*30      10*32         8*250
        2*2*2*6  8*12      8*18      10*24     16*20         10*200
                 2*2*4*6   12*12     12*20     2*160         20*100
                 2*2*2*12  2*2*6*6   2*120     2*2*2*40      2*1000
                           2*2*2*18  2*2*2*30  2*2*4*20      2*2*10*50
                                     2*2*6*10  2*2*8*10      2*2*2*250
                                               2*4*4*10      2*10*10*10
                                               2*2*2*2*2*10

Robert Israel, Table of n, a(n) for n = 1..10000

Note: A-numbers of Heinz-number sequences are in parentheses below.
Positions of ones are 1 and A000040, or A008578.
A version for partitions is A027187 (A028260).
Allowing odd length gives A108501 (bisection of A340785).
Allowing odd factors gives A339846.
An odd version is A340102.
- Factorizations -
A001055 counts factorizations, with strict case A045778.
A316439 counts factorizations by product and length.
A340101 counts factorizations into odd factors.
A340653 counts balanced factorizations.
A340831/A340832 count factorizations with odd maximum/minimum.
- Even -
A027187 counts partitions of even maximum (A244990).
A058696 counts partitions of even numbers (A300061).
A067661 counts strict partitions of even length (A030229).
A236913 counts partitions of even length and sum (A340784).
A340601 counts partitions of even rank (A340602).
Cf. A001147, A001222, A001749, A035363, A050320, A066207, A066208, A160786, A174725, A320655, A320656, A339890, A340851.

g:= proc(n, m, p)
 option remember;
 local F,r,x,i;
 # number of factorizations of n into even factors > m with number of factors == p (mod 2)
 if n = 1 then if p = 0 then return 1 else return 0 fi fi;
 if m > n  or n::odd then return 0 fi;
 F:= sort(convert(select(t -> t > m and t::even, numtheory:-divisors(n)),list));
 r:= 0;
 for x in F do
   for i from 1 while n mod x^i = 0 do
     r:= r + procname(n/x^i, x, (p+i) mod 2)
 od od;
 r
end proc:
f:= n -> g(4*n, 1, 0):
map(f, [$1..100]); # Robert Israel, Mar 16 2023

facs[n_]:=If[n<=1,{{}},Join@@Table[Map[Prepend[#,d]&,Select[facs[n/d],Min@@#>=d&]],{d,Rest[Divisors[n]]}]];
Table[Length[Select[facs[4n],EvenQ[Length[#]]&&Select[#,OddQ]=={}&]],{n,100}]

A340786aux(n, m=n, p=0) = if(1==n, (0==p), my(s=0); fordiv(n, d, if((d>1)&&(d<=m)&&!(d%2), s += A340786aux(n/d, d, 1-p))); (s));
A340786(n) = A340786aux(4*n); \\ Antti Karttunen, Apr 14 2022

A340853 Number of factorizations of n such that every factor is a multiple of the number of factors.

Original entry on oeis.org

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

Offset: 1

Gus Wiseman, Feb 04 2021

nonn

Also factorizations whose greatest common divisor is a multiple of the number of factors.

			The a(n) factorizations for n = 2, 4, 16, 48, 96, 144, 216, 240, 432:
  2   4     16    48     96     144     216      240     432
      2*2   2*8   6*8    2*48   2*72    4*54     4*60    6*72
            4*4   2*24   4*24   4*36    6*36     6*40    8*54
                  4*12   6*16   6*24    12*18    8*30    12*36
                         8*12   8*18    2*108    10*24   18*24
                                12*12   6*6*6    12*20   2*216
                                        3*3*24   2*120   4*108
                                        3*6*12           3*3*48
                                                         3*6*24
                                                         6*6*12
                                                         3*12*12

Positions of 1's are A048103.
Positions of terms > 1 are A100716.
The version for partitions is A143773 (A316428).
The reciprocal for partitions is A340693 (A340606).
The version for strict partitions is A340830.
The reciprocal version is A340851.
A320911 can be factored into squarefree semiprimes.
A340597 have an alt-balanced factorization.
A340656 lack a twice-balanced factorization, complement A340657.
- Factorizations -
A001055 counts factorizations, with strict case A045778.
A316439 counts factorizations by product and length.
A339846 counts factorizations of even length.
A339890 counts factorizations of odd length.
A340101 counts factorizations into odd factors, odd-length case A340102.
A340653 counts balanced factorizations.
A340785 counts factorizations into even factors, even-length case A340786.
A340831/A340832 counts factorizations with odd maximum/minimum.
A340854 cannot be factored with odd least factor, complement A340855.
Cf. A067538, A168659, A301987, A316413, A327517, A340596, A340599, A340654, A340655, A340827.

facs[n_]:=If[n<=1,{{}},Join@@Table[Map[Prepend[#,d]&,Select[facs[n/d],Min@@#>=d&]],{d,Rest[Divisors[n]]}]];
Table[Length[Select[facs[n],n>1&&Divisible[GCD@@#,Length[#]]&]],{n,100}]

A340693 Number of integer partitions of n where each part is a divisor of the number of parts.

Original entry on oeis.org

1, 1, 1, 2, 2, 3, 2, 5, 5, 7, 7, 10, 10, 14, 14, 17, 19, 24, 24, 32, 33, 42, 43, 58, 59, 75, 79, 98, 104, 124, 128, 156, 166, 196, 204, 239, 251, 292, 306, 352, 372, 426, 445, 514, 543, 616, 652, 745, 790, 896, 960, 1080, 1162, 1311, 1400, 1574, 1692, 1892

Offset: 0

Gus Wiseman, Jan 23 2021

nonn

The only strict partitions counted are (), (1), and (2,1).

Is there a simple generating function?

			The a(1) = 1 through a(9) = 7 partitions:
  1  11  21   22    311    2211    331      2222      333
         111  1111  2111   111111  2221     4211      4221
                    11111          4111     221111    51111
                                   211111   311111    222111
                                   1111111  11111111  321111
                                                      21111111
                                                      111111111

Note: Heinz numbers are given in parentheses below.
The reciprocal version is A143773 (A316428), with strict case A340830.
The case where length also divides n is A326842 (A326847).
The Heinz numbers of these partitions are A340606.
The version for factorizations is A340851, with reciprocal version A340853.
A018818 counts partitions of n into divisors of n (A326841).
A047993 counts balanced partitions (A106529).
A067538 counts partitions of n whose length/max divides n (A316413/A326836).
A067539 counts partitions with integer geometric mean (A326623).
A072233 counts partitions by sum and length.
A168659 = partitions whose greatest part divides their length (A340609).
A168659 = partitions whose length divides their greatest part (A340610).
A326843 = partitions of n whose length and maximum both divide n (A326837).
A330950 = partitions of n whose Heinz number is divisible by n (A324851).
Cf. A000041, A003114, A006141, A033630, A064174, A074761, A102627, A200750, A237984, A298423, A340827.

Table[Length[Select[IntegerPartitions[n],And@@IntegerQ/@(Length[#]/#)&]],{n,0,30}]

cp's OEIS Frontend

A168659 Number of partitions of n such that the number of parts is divisible by the greatest part. Also number of partitions of n such that the greatest part is divisible by the number of parts.

Views

Author

Keywords

Examples

Links

Crossrefs

Programs

Maple

Mathematica

Formula

Extensions

A340785 Number of factorizations of 2n into even factors > 1.

Views

Author

Keywords

Examples

Links

Crossrefs

Programs

Mathematica

PARI

Formula

A340852 Numbers that can be factored in such a way that every factor is a divisor of the number of factors.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

A340830 Number of strict integer partitions of n such that every part is a multiple of the number of parts.

Views

Author

Keywords

Examples

Crossrefs

Programs

Mathematica

Formula

A340827 Number of strict integer partitions of n into divisors of n whose length also divides n.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

PARI

Scheme

Extensions

A340786 Number of factorizations of 4n into an even number of even factors > 1.

Views

Author

Keywords

Examples

Links

Crossrefs

Programs

Maple

Mathematica

PARI

A340853 Number of factorizations of n such that every factor is a multiple of the number of factors.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

A340693 Number of integer partitions of n where each part is a divisor of the number of parts.

Views

Author

Keywords

Comments