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.

Showing 1-10 of 12 results. Next

A360068 Number of integer partitions of n such that the parts have the same mean as the multiplicities.

Original entry on oeis.org

1, 1, 0, 0, 1, 0, 0, 0, 2, 1, 0, 0, 6, 0, 0, 0, 6, 0, 7, 0, 1, 0, 0, 0, 0, 90, 0, 63, 0, 0, 0, 0, 11, 0, 0, 0, 436, 0, 0, 0, 0, 0, 0, 0, 0, 2157, 0, 0, 240, 1595, 22, 0, 0, 0, 6464, 0, 0, 0, 0, 0, 0, 0, 0, 11628, 4361, 0, 0, 0, 0, 0, 0, 0, 12927, 0, 0, 621, 0
Offset: 0

Views

Author

Gus Wiseman, Jan 27 2023

Keywords

Comments

Note that such a partition cannot be strict for n > 1.
Conjecture: If n is squarefree, then a(n) = 0.

Examples

			The n = 1, 4, 8, 9, 12, 16, 18 partitions (D=13):
  (1)  (22)  (3311)  (333)  (322221)  (4444)      (444222)
             (5111)         (332211)  (43222111)  (444411)
                            (422211)  (43321111)  (552222)
                            (522111)  (53221111)  (555111)
                            (531111)  (54211111)  (771111)
                            (621111)  (63211111)  (822222)
                                                  (D11111)
For example, the partition (4,3,3,3,3,3,2,2,1,1) has mean 5/2, and its multiplicities (1,5,2,2) also have mean 5/2, so it is counted under a(20).

Crossrefs

These partitions are ranked by A359903, for prime factors A359904.
Positions of positive terms are A360070.
A000041 counts partitions, strict A000009.
A058398 counts partitions by mean, see also A008284, A327482.
A088529/A088530 gives mean of prime signature (A124010).
A326567/A326568 gives mean of prime indices (A112798).
A360069 counts partitions whose multiplicities have integer mean.
Cf. A067340, A067538, A082550, A240219, A316313, A327475, A349156, A359893, A359897, A359905.

Programs

  • Mathematica
    Table[Length[Select[IntegerPartitions[n],Mean[#]==Mean[Length/@Split[#]]&]],{n,0,30}]

A360071 Regular tetrangle where T(n,k,i) = number of integer partitions of n of length k with i distinct parts.

Original entry on oeis.org

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

Views

Author

Gus Wiseman, Jan 28 2023

Keywords

Comments

I call this a tetrangle because it is a sequence of finite triangles. - Gus Wiseman, Jan 30 2023

Examples

			Tetrangle begins:
  1   1     1       1         1           1             1
      1 0   0 1     1 1       0 2         1 2           0 3
            1 0 0   0 1 0     0 2 0       1 1 1         0 3 1
                    1 0 0 0   0 1 0 0     0 2 0 0       0 2 1 0
                              1 0 0 0 0   0 1 0 0 0     0 2 0 0 0
                                          1 0 0 0 0 0   0 1 0 0 0 0
                                                        1 0 0 0 0 0 0
For example, finite triangle n = 5 counts the following partitions:
    (5)
     .    (41)(32)
     .   (311)(221)  .
     .     (2111)    .   .
  (11111)     .      .   .   .

Crossrefs

Row sums are A008284 (partitions by number of parts), reverse A058398.
First columns i = 1 are A051731.
Last columns i = k are A060016.
Column sums are A116608 (partitions by number of distinct parts).
Positive terms are counted by A360072.
A000041 counts partitions, strict A000009.
Other tetrangles: A318393, A318816, A320808, A334433, A345197.
Cf. A055884, A327482, A331195, A360010, A360069.

Programs

  • Mathematica
    Table[Length[Select[IntegerPartitions[n], Length[#]==k&&Length[Union[#]]==i&]],{n,1,9},{k,1,n},{i,1,k}]

A359903 Numbers whose prime indices and prime signature have the same mean.

Original entry on oeis.org

1, 2, 9, 88, 100, 125, 624, 756, 792, 810, 880, 900, 1312, 2401, 4617, 4624, 6240, 7392, 7560, 7920, 8400, 9261, 9604, 9801, 10648, 12416, 23424, 33984, 37760, 45792, 47488, 60912, 66176, 71552, 73920, 75200, 78720, 83592, 89216, 89984, 91264, 91648, 99456
Offset: 1

Views

Author

Gus Wiseman, Jan 24 2023

Keywords

Comments

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 number's prime signature (row n of A124010) is the sequence of positive exponents in its prime factorization.

Examples

			The terms together with their prime indices begin:
      1: {}
      2: {1}
      9: {2,2}
     88: {1,1,1,5}
    100: {1,1,3,3}
    125: {3,3,3}
    624: {1,1,1,1,2,6}
    756: {1,1,2,2,2,4}
    792: {1,1,1,2,2,5}
    810: {1,2,2,2,2,3}
    880: {1,1,1,1,3,5}
    900: {1,1,2,2,3,3}
   1312: {1,1,1,1,1,13}
   2401: {4,4,4,4}
   4617: {2,2,2,2,2,8}
   4624: {1,1,1,1,7,7}
   6240: {1,1,1,1,1,2,3,6}
   7392: {1,1,1,1,1,2,4,5}
   7560: {1,1,1,2,2,2,3,4}
   7920: {1,1,1,1,2,2,3,5}
Example: 810 has prime indices {1,2,2,2,2,3} and prime exponents (1,4,1), both of which have mean 2, so 810 is in the sequence.
Example: 78720 has prime indices {1,1,1,1,1,1,1,2,3,13} and prime exponents (7,1,1,1), both of which have mean 5/2, so 78720 is in the sequence.

Crossrefs

Prime indices are A112798, sum A056239, mean A326567/A326568.
Prime signature is A124010, sum A001222, mean A088529/A088530.
For prime factors instead of indices we have A359904.
Partitions with these Heinz numbers are counted by A360068.
A058398 counts partitions by mean, see also A008284, A327482.
A067340 lists numbers whose prime signature has integer mean.
A316413 lists numbers whose prime indices have integer mean.
A360005 gives median of prime indices (times two).
Cf. A240219, A316313, A326622, A327473, A327476, A348551, A359905, A359908, A360008, A360069.

Programs

  • Mathematica
    prix[n_]:=If[n==1,{},Flatten[Cases[FactorInteger[n],{p_,k_}:>Table[PrimePi[p],{k}]]]];
prisig[n_]:=If[n==1,{},Last/@FactorInteger[n]];
Select[Range[1000],Mean[prix[#]]==Mean[prisig[#]]&]

A360241 Number of integer partitions of n whose distinct parts have integer mean.

Original entry on oeis.org

0, 1, 2, 2, 4, 3, 8, 6, 13, 13, 22, 19, 43, 34, 56, 66, 97, 92, 156, 143, 233, 256, 322, 341, 555, 542, 710, 831, 1098, 1131, 1644, 1660, 2275, 2484, 3035, 3492, 4731, 4848, 6063, 6893, 8943, 9378, 12222, 13025, 16520, 18748, 22048, 24405, 31446, 33698, 41558
Offset: 0

Views

Author

Gus Wiseman, Feb 02 2023

Keywords

Examples

			The a(1) = 1 through a(8) = 13 partitions:
  (1)  (2)   (3)    (4)     (5)      (6)       (7)        (8)
       (11)  (111)  (22)    (311)    (33)      (331)      (44)
                    (31)    (11111)  (42)      (511)      (53)
                    (1111)           (51)      (3211)     (62)
                                     (222)     (31111)    (71)
                                     (321)     (1111111)  (422)
                                     (3111)               (2222)
                                     (111111)             (3221)
                                                          (3311)
                                                          (5111)
                                                          (32111)
                                                          (311111)
                                                          (11111111)
For example, the partition (32111) has distinct parts {1,2,3} with mean 2, so is counted under a(8).

Crossrefs

For parts instead of distinct parts we have A067538, ranked by A316413.
The strict case is A102627.
These partitions are ranked by A326621.
For multiplicities instead of distinct parts: A360069, ranked by A067340.
A000041 counts integer partitions, strict A000009.
A008284 counts partitions by number of parts.
A051293 counts subsets with integer mean, median A000975.
A058398 counts partitions by mean, also A327482.
A116608 counts partitions by number of distinct parts.
A326619/A326620 gives mean of distinct prime indices.
A326622 counts factorizations with integer mean, strict A328966.
A360071 counts partitions by number of parts and number of distinct parts.
The following count partitions:
- A360242 mean(parts) != mean(distinct parts), ranked by A360246.
- A360243 mean(parts) = mean(distinct parts), ranked by A360247.
- A360250 mean(parts) > mean(distinct parts), ranked by A360252.
- A360251 mean(parts) < mean(distinct parts), ranked by A360253.
Cf. A067539, A078174, A082550, A240219, A316313, A325347, A326567/A326568, A326669, A327475, A349156.

Programs

  • Mathematica
    Table[Length[Select[IntegerPartitions[n],IntegerQ[Mean[Union[#]]]&]],{n,0,30}]

A360243 Number of integer partitions of n where the parts have the same mean as the distinct parts.

Original entry on oeis.org

1, 1, 2, 3, 4, 4, 8, 6, 11, 11, 17, 13, 28, 19, 32, 40, 48, 39, 71, 55, 103, 105, 110, 105, 197, 170, 195, 237, 319, 257, 462, 341, 515, 543, 584, 784, 1028, 761, 973, 1153, 1606, 1261, 2137, 1611, 2368, 2815, 2575, 2591, 4393, 3798, 4602, 4663, 5777, 5121
Offset: 0

Views

Author

Gus Wiseman, Feb 04 2023

Keywords

Examples

			The a(1) = 1 through a(8) = 11 partitions:
  (1)  (2)   (3)    (4)     (5)      (6)       (7)        (8)
       (11)  (21)   (22)    (32)     (33)      (43)       (44)
             (111)  (31)    (41)     (42)      (52)       (53)
                    (1111)  (11111)  (51)      (61)       (62)
                                     (222)     (421)      (71)
                                     (321)     (1111111)  (431)
                                     (2211)               (521)
                                     (111111)             (2222)
                                                          (3221)
                                                          (3311)
                                                          (11111111)

Crossrefs

For multiplicities instead of distinct parts we have A360068.
The complement is counted by A360242, ranks A360246.
For median instead of mean we have A360245, complement A360244.
These partitions have ranks A360247.
Cf. A360250 and A360251, ranks A360252 and A360253.
A000041 counts integer partitions, strict A000009.
A008284 counts partitions by number of parts.
A058398 counts partitions by mean, also A327482.
A067538 counts partitions with integer mean, strict A102627, ranks A316413.
A116608 counts partitions by number of distinct parts.
A360071 counts partitions by number of parts and number of distinct parts.
A360241 counts partitions whose distinct parts have integer mean.
Cf. A051293, A067340, A240219, A316313, A326567/A326568, A326619/A326620, A326621, A349156, A360069.

Programs

  • Mathematica
    Table[Length[Select[IntegerPartitions[n],Mean[#]==Mean[Union[#]]&]],{n,0,30}]

A359905 Numbers whose prime indices and prime signature both have integer mean.

Original entry on oeis.org

2, 3, 4, 5, 7, 8, 9, 10, 11, 13, 16, 17, 19, 21, 22, 23, 25, 27, 29, 30, 31, 32, 34, 37, 39, 41, 43, 46, 47, 49, 53, 55, 57, 59, 61, 62, 64, 67, 71, 73, 78, 79, 81, 82, 83, 85, 87, 88, 89, 91, 94, 97, 100, 101, 103, 105, 107, 109, 110, 111, 113, 115, 118, 121
Offset: 1

Views

Author

Gus Wiseman, Jan 25 2023

Keywords

Comments

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 number's prime signature (row n of A124010) is the sequence of positive exponents in its prime factorization.

Examples

			The terms together with their prime indices begin:
     2: {1}          19: {8}            39: {2,6}
     3: {2}          21: {2,4}          41: {13}
     4: {1,1}        22: {1,5}          43: {14}
     5: {3}          23: {9}            46: {1,9}
     7: {4}          25: {3,3}          47: {15}
     8: {1,1,1}      27: {2,2,2}        49: {4,4}
     9: {2,2}        29: {10}           53: {16}
    10: {1,3}        30: {1,2,3}        55: {3,5}
    11: {5}          31: {11}           57: {2,8}
    13: {6}          32: {1,1,1,1,1}    59: {17}
    16: {1,1,1,1}    34: {1,7}          61: {18}
    17: {7}          37: {12}           62: {1,11}

Crossrefs

A058398 counts partitions by mean, see also A008284, A327482.
A067340 lists numbers whose prime signature has integer mean.
A112798 = prime indices, length A001222, sum A056239, mean A326567/A326568.
A124010 lists prime signature, mean A088529/A088530.
A316413 lists numbers whose prime indices have integer mean.
A326622 counts factorizations with integer mean, strict A328966.
Cf. A327473, A348551, A359904, A359908, A360005, A360068, A360069.

Programs

  • Mathematica
    prix[n_]:=If[n==1,{},Flatten[Cases[FactorInteger[n],{p_,k_}:>Table[PrimePi[p],{k}]]]];
prisig[n_]:=If[n==1,{},Last/@FactorInteger[n]];
Select[Range[100],IntegerQ[Mean[prix[#]]]&&IntegerQ[Mean[prisig[#]]]&]

Formula

Intersection of A316413 and A067340.

A359913 Numbers whose multiset of prime factors has integer median.

Original entry on oeis.org

2, 3, 4, 5, 7, 8, 9, 11, 12, 13, 15, 16, 17, 18, 19, 20, 21, 23, 24, 25, 27, 28, 29, 30, 31, 32, 33, 35, 37, 39, 40, 41, 42, 43, 44, 45, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 59, 61, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 75, 76, 77, 78, 79, 80, 81
Offset: 1

Views

Author

Gus Wiseman, Jan 25 2023

Keywords

Comments

The median of a multiset is either the middle part (for odd length), or the average of the two middle parts (for even length).

Examples

			The terms together with their prime factors begin:
   2: {2}
   3: {3}
   4: {2,2}
   5: {5}
   7: {7}
   8: {2,2,2}
   9: {3,3}
  11: {11}
  12: {2,2,3}
  13: {13}
  15: {3,5}
  16: {2,2,2,2}
  17: {17}
  18: {2,3,3}
  19: {19}
  20: {2,2,5}
  21: {3,7}
  23: {23}
  24: {2,2,2,3}

Crossrefs

Prime factors are listed by A027746.
The complement is A072978, for prime indices A359912.
For mean instead of median we have A078175, for prime indices A316413.
For prime indices instead of factors we have A359908, counted by A325347.
Positions of even terms in A360005.
A067340 lists numbers whose prime signature has integer mean.
A112798 lists prime indices, length A001222, sum A056239.
A325347 counts partitions with integer median, strict A359907.
A326567/A326568 gives the mean of prime indices, conjugate A326839/A326840.
A359893 and A359901 count partitions by median, odd-length A359902.
Cf. A067538, A175352, A348551, A359890, A359905, A360007, A360006, A360069.

Programs

  • Mathematica
    Select[Range[2,100],IntegerQ[Median[Flatten[ConstantArray@@@FactorInteger[#]]]]&]

A360687 Number of integer partitions of n whose multiplicities have integer median.

Original entry on oeis.org

1, 2, 3, 4, 5, 9, 10, 16, 22, 34, 42, 65, 80, 115, 145, 195, 240, 324, 396, 519, 635, 814, 994, 1270, 1549, 1952, 2378, 2997, 3623, 4521, 5466, 6764, 8139, 10008, 12023, 14673, 17534, 21273, 25336, 30593, 36302, 43575, 51555, 61570, 72653, 86382, 101676
Offset: 1

Views

Author

Gus Wiseman, Feb 20 2023

Keywords

Comments

The median of a multiset is either the middle part (for odd length), or the average of the two middle parts (for even length).

Examples

			The a(1) = 1 through a(8) = 16 partitions:
  (1)  (2)   (3)    (4)     (5)      (6)       (7)        (8)
       (11)  (21)   (22)    (32)     (33)      (43)       (44)
             (111)  (31)    (41)     (42)      (52)       (53)
                    (1111)  (2111)   (51)      (61)       (62)
                            (11111)  (222)     (421)      (71)
                                     (321)     (2221)     (431)
                                     (2211)    (3211)     (521)
                                     (3111)    (4111)     (2222)
                                     (111111)  (211111)   (3221)
                                               (1111111)  (3311)
                                                          (4211)
                                                          (5111)
                                                          (32111)
                                                          (221111)
                                                          (311111)
                                                          (11111111)
For example, the partition y = (3,2,2,1) has multiplicities (1,2,1), and the multiset {1,1,2} has median 1, so y is counted under a(8).

Crossrefs

The case of an odd number of multiplicities is A090794.
For mean instead of median we have A360069, ranks A067340.
These partitions have ranks A360553.
The complement is counted by A360690, ranks A360554.
A058398 counts partitions by mean, see also A008284, A327482.
A124010 gives prime signature, sorted A118914, mean A088529/A088530.
A325347 = partitions w/ integer median, strict A359907, complement A307683.
A359893 and A359901 count partitions by median, odd-length A359902.
Cf. A000975, A329976, A359908, A360068, A360460, A360550, A360556, A360688.

Programs

  • Mathematica
    Table[Length[Select[IntegerPartitions[n],IntegerQ[Median[Length/@Split[#]]]&]],{n,30}]

A362559 Number of integer partitions of n whose weighted sum is divisible by n.

Original entry on oeis.org

1, 1, 2, 1, 2, 3, 3, 3, 5, 4, 5, 7, 8, 11, 14, 14, 18, 25, 28, 26, 42, 47, 52, 73, 77, 100, 118, 122, 158, 188, 219, 266, 313, 367, 412, 489, 578, 698, 809, 914, 1094, 1268, 1472, 1677, 1948, 2305, 2656, 3072, 3527, 4081, 4665, 5342, 6225, 7119, 8150, 9408
Offset: 1

Views

Author

Gus Wiseman, Apr 24 2023

Keywords

Comments

The (one-based) weighted sum of a sequence (y_1,...,y_k) is Sum_{i=1..k} i*y_i. This is also the sum of partial sums of the reverse.
Also the number of n-multisets of positive integers that (1) have integer mean, (2) cover an initial interval, and (3) have weakly decreasing multiplicities.
Conjecture: A partition of n has weighted sum divisible by n iff its reverse has weighted sum divisible by n.

Examples

			The weighted sum of y = (4,2,2,1) is 1*4+2*2+3*2+4*1 = 18, which is a multiple of 9, so y is counted under a(9).
The a(1) = 1 through a(9) = 5 partitions:
  (1)  (2)  (3)    (4)  (5)      (6)     (7)        (8)       (9)
            (111)       (11111)  (222)   (3211)     (3311)    (333)
                                 (3111)  (1111111)  (221111)  (4221)
                                                              (222111)
                                                              (111111111)

Crossrefs

For median instead of mean we have A362558.
The complement is counted by A362560.
A000041 counts integer partitions, strict A000009.
A008284/A058398/A327482 count partitions by mean.
A264034 counts partitions by weighted sum.
A304818 = weighted sum of prime indices, row-sums of A359361.
A318283 = weighted sum of reversed prime indices, row-sums of A358136.
Cf. A001227, A051293, A067538, A067539, A240219, A261079, A322439, A326622, A359893, A360068, A360069, A362051.

Programs

  • Mathematica
    Table[Length[Select[IntegerPartitions[n], Divisible[Total[Accumulate[Reverse[#]]],n]&]],{n,30}]

A362560 Number of integer partitions of n whose weighted sum is not divisible by n.

Original entry on oeis.org

0, 1, 1, 4, 5, 8, 12, 19, 25, 38, 51, 70, 93, 124, 162, 217, 279, 360, 462, 601, 750, 955, 1203, 1502, 1881, 2336, 2892, 3596, 4407, 5416, 6623, 8083, 9830, 11943, 14471, 17488, 21059, 25317, 30376, 36424, 43489, 51906, 61789, 73498, 87186, 103253, 122098
Offset: 1

Views

Author

Gus Wiseman, Apr 28 2023

Keywords

Comments

The (one-based) weighted sum of a sequence (y_1,...,y_k) is Sum_{i=1..k} i*y_i. This is also the sum of partial sums of the reverse.
Conjecture: A partition of n has weighted sum divisible by n iff its reverse has weighted sum divisible by n.

Examples

			The weighted sum of y = (3,3,1) is 1*3+2*3+3*1 = 12, which is not a multiple of 7, so y is counted under a(7).
The a(2) = 1 through a(7) = 12 partitions:
  (11)  (21)  (22)    (32)    (33)      (43)
              (31)    (41)    (42)      (52)
              (211)   (221)   (51)      (61)
              (1111)  (311)   (321)     (322)
                      (2111)  (411)     (331)
                              (2211)    (421)
                              (21111)   (511)
                              (111111)  (2221)
                                        (4111)
                                        (22111)
                                        (31111)
                                        (211111)

Crossrefs

For median instead of mean we have A322439 aerated, complement A362558.
The complement is counted by A362559.
A000041 counts integer partitions, strict A000009.
A008284/A058398/A327482 count partitions by mean.
A264034 counts partitions by weighted sum.
A304818 = weighted sum of prime indices, row-sums of A359361.
A318283 = weighted sum of reversed prime indices, row-sums of A358136.
Cf. A001227, A051293, A067538, A240219, A261079, A326622, A349156, A360068, A360069, A360241, A362051.

Programs

  • Mathematica
    Table[Length[Select[IntegerPartitions[n],!Divisible[Total[Accumulate[Reverse[#]]],n]&]],{n,30}]
Showing 1-10 of 12 results. Next

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

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