cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

Previous Showing 11-17 of 17 results.

A340600 Number of non-isomorphic balanced multiset partitions of weight n.

Original entry on oeis.org

1, 1, 0, 4, 7, 16, 52, 206, 444, 1624, 5462, 19188, 62890, 215367, 765694, 2854202, 10634247, 39842786, 150669765, 581189458, 2287298588, 9157598354, 37109364812, 151970862472, 629048449881, 2635589433705, 11184718653563, 48064965080106, 208988724514022, 918639253237646, 4079974951494828
Offset: 0

Views

Author

Gus Wiseman, Feb 05 2021

Keywords

Comments

We define a multiset partition to be balanced if it has exactly as many parts as the greatest size of a part.

Examples

			Non-isomorphic representatives of the a(1) = 1 through a(5) = 16 multiset partitions (empty column indicated by dot):
  {{1}}  .  {{1},{1,1}}  {{1,1},{1,1}}  {{1},{1},{1,1,1}}
            {{1},{2,2}}  {{1,1},{2,2}}  {{1},{1},{1,2,2}}
            {{1},{2,3}}  {{1,2},{1,2}}  {{1},{1},{2,2,2}}
            {{2},{1,2}}  {{1,2},{2,2}}  {{1},{1},{2,3,3}}
                         {{1,2},{3,3}}  {{1},{1},{2,3,4}}
                         {{1,2},{3,4}}  {{1},{2},{1,2,2}}
                         {{1,3},{2,3}}  {{1},{2},{2,2,2}}
                                        {{1},{2},{2,3,3}}
                                        {{1},{2},{3,3,3}}
                                        {{1},{2},{3,4,4}}
                                        {{1},{2},{3,4,5}}
                                        {{1},{3},{2,3,3}}
                                        {{1},{4},{2,3,4}}
                                        {{2},{2},{1,2,2}}
                                        {{2},{3},{1,2,3}}
                                        {{3},{3},{1,2,3}}

Crossrefs

The version for partitions is A047993.
The co-balanced version is A319616.
The cross-balanced version is A340651.
The twice-balanced version is A340652.
The version for factorizations is A340653.
A007716 counts non-isomorphic multiset partitions.
A007718 counts non-isomorphic connected multiset partitions.
A316980 counts non-isomorphic strict multiset partitions.
Other balance-related sequences:
- A098124 counts balanced compositions.
- A106529 lists balanced numbers.
- A340596 counts co-balanced factorizations.
- A340597 lists numbers with an alt-balanced factorization.
- A340598 counts balanced set partitions.
- A340599 counts alt-balanced factorizations.
Cf. A001055, A006141, A007717, A316983, A320663, A324522, A340654, A340655.

Programs

  • PARI
    \\ See A340652 for G.
seq(n)={Vec(1 + sum(k=1,n,polcoef(G(n,n,k,y),k,y) - polcoef(G(n,n,k-1,y),k,y)))} \\ Andrew Howroyd, Jan 15 2024

Extensions

a(11) onwards from Andrew Howroyd, Jan 15 2024

A340652 Number of non-isomorphic twice-balanced multiset partitions of weight n.

Original entry on oeis.org

1, 1, 0, 2, 3, 6, 20, 65, 134, 482, 1562, 4974, 15466, 51768, 179055, 631737, 2216757, 7905325, 28768472, 106852116, 402255207, 1532029660, 5902839974, 23041880550, 91129833143, 364957188701, 1478719359501, 6058859894440, 25100003070184, 105123020009481, 445036528737301
Offset: 0

Views

Author

Gus Wiseman, Feb 07 2021

Keywords

Comments

We define a multiset partition to be twice-balanced if all of the following are equal:
(1) the number of parts;
(2) the number of distinct vertices;
(3) the greatest size of a part.

Examples

			Non-isomorphic representatives of the a(1) = 1 through a(5) = 6 multiset partitions (empty column indicated by dot):
  {{1}}  .  {{1},{2,2}}  {{1,1},{2,2}}  {{1},{1},{2,3,3}}
            {{2},{1,2}}  {{1,2},{1,2}}  {{1},{2},{2,3,3}}
                         {{1,2},{2,2}}  {{1},{2},{3,3,3}}
                                        {{1},{3},{2,3,3}}
                                        {{2},{3},{1,2,3}}
                                        {{3},{3},{1,2,3}}

Crossrefs

The co-balanced version is A319616.
The singly balanced version is A340600.
The cross-balanced version is A340651.
The version for factorizations is A340655.
A007716 counts non-isomorphic multiset partitions.
A007718 counts non-isomorphic connected multiset partitions.
A303975 counts distinct prime factors in prime indices.
A316980 counts non-isomorphic strict multiset partitions.
Other balance-related sequences:
- A047993 counts balanced partitions.
- A106529 lists balanced numbers.
- A340596 counts co-balanced factorizations.
- A340653 counts balanced factorizations.
- A340657/A340656 list numbers with/without a twice-balanced factorization.
Cf. A001055, A001221, A001222, A007717, A316983, A320663, A339888, A340597, A340599, A340654.

Programs

  • PARI
    EulerT(v)={Vec(exp(x*Ser(dirmul(v, vector(#v, n, 1/n))))-1, -#v)}
permcount(v) = {my(m=1, s=0, k=0, t); for(i=1, #v, t=v[i]; k=if(i>1&&t==v[i-1], k+1, 1); m*=t*k; s+=t); s!/m}
K(q, t, k)={EulerT(Vec(sum(j=1, #q, my(g=gcd(t, q[j])); g*x^(q[j]/g)) + O(x*x^k), -k))}
G(m,n,k,y=1)={my(s=0); forpart(q=m, s+=permcount(q)*exp(sum(t=1, n, y^t*subst(x*Polrev(K(q, t, min(k,n\t))), x, x^t)/t, O(x*x^n)))); s/m!}
seq(n)={Vec(1 + sum(k=1,n, polcoef(G(k,n,k,y) - G(k-1,n,k,y) - G(k,n,k-1,y) + G(k-1,n,k-1,y), k, y)))} \\ Andrew Howroyd, Jan 15 2024

Extensions

a(11) onwards from Andrew Howroyd, Jan 15 2024

A340851 Number of factorizations of n such that every factor is a divisor of the number of factors.

Original entry on oeis.org

1, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 2, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0
Offset: 1

Views

Author

Gus Wiseman, Feb 04 2021

Keywords

Comments

Also factorizations whose number of factors is divisible by their least common multiple.

Examples

			The a(n) factorizations for n = 8192, 46656, 73728:
  2*2*2*2*2*4*8*8          6*6*6*6*6*6              2*2*2*2*2*2*2*2*2*4*6*6
  2*2*2*2*4*4*4*8          2*2*2*2*2*2*3*3*3*3*3*3  2*2*2*2*2*2*2*2*3*4*4*6
  2*2*2*4*4*4*4*4                                   2*2*2*2*2*2*2*3*3*4*4*4
  2*2*2*2*2*2*2*2*2*2*2*4                           2*2*2*2*2*2*2*2*2*2*6*12
                                                    2*2*2*2*2*2*2*2*2*3*4*12

Crossrefs

The version for partitions is A340693, with reciprocal version A143773.
Positions of nonzero terms are A340852.
The reciprocal version is A340853.
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 numbers, even-length case A340786.
A340831/A340832 count factorizations with odd maximum/minimum.
A340854 cannot be factored with odd least factor, complement A340855.
Cf. A067538, A074761, A168659, A301987, A327517, A340596, A340599, A340654, A340655, A340827, A340830.

Programs

  • Mathematica
    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],And@@IntegerQ/@(Length[#]/#)&]],{n,100}]

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

Views

Author

Gus Wiseman, Feb 04 2021

Keywords

Comments

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

Examples

			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

Crossrefs

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.

Programs

  • Mathematica
    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}]

A340611 Number of integer partitions of n of length 2^k where k is the greatest part.

Original entry on oeis.org

1, 0, 1, 0, 0, 1, 1, 1, 1, 0, 1, 1, 2, 2, 3, 3, 4, 4, 4, 4, 4, 4, 5, 5, 6, 7, 8, 10, 12, 14, 16, 19, 21, 24, 27, 29, 32, 34, 36, 38, 41, 42, 45, 47, 50, 52, 56, 58, 63, 66, 71, 75, 83, 88, 98, 106, 118, 128, 143, 155, 173, 188, 208, 226, 250, 270, 297, 321, 350
Offset: 0

Views

Author

Gus Wiseman, Jan 28 2021

Keywords

Comments

Also the number of integer partitions of n with maximum 2^k where k is the length.

Examples

			The partitions for n = 12, 14, 16, 22, 24:
  32211111  32222111  32222221  33333322          33333333
  33111111  33221111  33222211  33333331          4222221111111111
            33311111  33322111  4222111111111111  4322211111111111
                      33331111  4321111111111111  4332111111111111
                                4411111111111111  4422111111111111
                                                  4431111111111111
The conjugate partitions:
  (8,2,2)  (8,3,3)  (8,4,4)  (8,7,7)     (8,8,8)
  (8,3,1)  (8,4,2)  (8,5,3)  (8,8,6)     (16,3,3,2)
           (8,5,1)  (8,6,2)  (16,2,2,2)  (16,4,2,2)
                    (8,7,1)  (16,3,2,1)  (16,4,3,1)
                             (16,4,1,1)  (16,5,2,1)
                                         (16,6,1,1)

Crossrefs

Note: A-numbers of Heinz-number sequences are in parentheses below.
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).
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).
A340597 lists numbers with an alt-balanced factorization.
A340653 counts balanced factorizations.
A340689 have a factorization of length 2^max.
A340690 have a factorization of maximum 2^length.
Cf. A003114, A006141, A064174, A098124, A117409, A200750, A340385, A340387, A340599, A340601.

Programs

  • Mathematica
    Table[Length[Select[IntegerPartitions[n],Length[#]==2^Max@@#&]],{n,0,30}]

A340689 Numbers with a factorization of length 2^k into factors > 1, where k is the greatest factor.

Original entry on oeis.org

1, 16, 384, 576, 864, 1296, 1944, 2916, 4374, 6561, 131072, 196608, 262144, 294912, 393216, 442368, 524288, 589824, 663552, 786432, 884736, 995328, 1048576, 1179648, 1327104, 1492992, 1572864, 1769472, 1990656, 2097152, 2239488, 2359296, 2654208, 2985984, 3145728
Offset: 1

Views

Author

Gus Wiseman, Jan 28 2021

Keywords

Examples

			The initial terms and a valid factorization of each are:
         1 =
        16 = 2*2*2*2
       384 = 2*2*2*2*2*2*2*3
       576 = 2*2*2*2*2*2*3*3
       864 = 2*2*2*2*2*3*3*3
      1296 = 2*2*2*2*3*3*3*3
      1944 = 2*2*2*3*3*3*3*3
      2916 = 2*2*3*3*3*3*3*3
      4374 = 2*3*3*3*3*3*3*3
      6561 = 3*3*3*3*3*3*3*3
    131072 = 2*2*2*2*2*2*2*2*2*2*2*2*2*2*2*4
    196608 = 2*2*2*2*2*2*2*2*2*2*2*2*2*2*3*4
    262144 = 2*2*2*2*2*2*2*2*2*2*2*2*2*2*4*4
    294912 = 2*2*2*2*2*2*2*2*2*2*2*2*2*3*3*4

Links

Crossrefs

Partitions of the prescribed type are counted by A340611.
The conjugate version is A340690.
A001055 counts factorizations, with strict case A045778.
A047993 counts balanced partitions.
A316439 counts factorizations by product and length.
A340596 counts co-balanced factorizations.
A340597 lists numbers with an alt-balanced factorization.
A340653 counts balanced factorizations.
Cf. A106529, A117409, A200750, A325134, A340386, A340387, A340599, A340607, A340654, A340655, A340656, A340657.

Programs

  • Mathematica
    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[#],Length[#]==2^Max@@#&]!={}&]

Extensions

More terms from Chai Wah Wu, Feb 01 2021

A340690 Numbers with a factorization whose greatest factor is 2^k, where k is the number of factors.

Original entry on oeis.org

2, 8, 12, 16, 32, 48, 64, 72, 80, 96, 112, 120, 128, 144, 160, 168, 192, 200, 224, 240, 256, 280, 288, 320, 336, 384, 392, 432, 448, 480, 512, 576, 640, 672, 704, 720, 768, 800, 832, 864, 896, 960, 1008, 1024, 1056, 1120, 1152, 1200, 1248, 1280, 1296, 1344
Offset: 1

Views

Author

Gus Wiseman, Jan 28 2021

Keywords

Examples

			The initial terms and a valid factorization of each:
      2 = 2           168 = 3*7*8        512 = 2*2*2*2*32
      8 = 2*4         192 = 2*2*3*16     576 = 2*2*9*16
     12 = 3*4         200 = 5*5*8        640 = 2*2*10*16
     16 = 4*4         224 = 4*7*8        672 = 2*3*7*16
     32 = 2*2*8       240 = 5*6*8        704 = 2*2*11*16
     48 = 2*3*8       256 = 2*2*4*16     720 = 3*3*5*16
     64 = 2*4*8       280 = 5*7*8        768 = 2*2*2*3*32
     72 = 3*3*8       288 = 2*3*3*16     800 = 2*5*5*16
     80 = 2*5*8       320 = 2*2*5*16     832 = 2*2*13*16
     96 = 2*6*8       336 = 6*7*8        864 = 2*3*9*16
    112 = 2*7*8       384 = 2*2*6*16     896 = 2*2*14*16
    120 = 3*5*8       392 = 7*7*8        960 = 2*2*15*16
    128 = 2*2*2*16    432 = 3*3*3*16    1008 = 3*3*7*16
    144 = 3*6*8       448 = 2*2*7*16    1024 = 2*2*2*4*32
    160 = 4*5*8       480 = 2*3*5*16    1056 = 2*3*11*16

Crossrefs

Partitions of the prescribed type are counted by A340611.
The conjugate version is A340689.
A001055 counts factorizations, with strict case A045778.
A047993 counts balanced partitions.
A316439 counts factorizations by product and length.
A340596 counts co-balanced factorizations.
A340597 lists numbers with an alt-balanced factorization.
A340653 counts balanced factorizations.
Cf. A106529, A117409, A200750, A325134, A340386, A340387, A340599, A340607, A340654, A340655, A340656, A340657.

Programs

  • Mathematica
    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[#],2^Length[#]==Max@@#&]!={}&]
Previous Showing 11-17 of 17 results.

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.