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-5 of 5 results.

A238479 Number of partitions of n whose median is not a part.

Original entry on oeis.org

0, 0, 1, 1, 2, 3, 4, 5, 8, 10, 13, 18, 23, 30, 40, 50, 64, 83, 104, 131, 166, 206, 256, 320, 394, 485, 598, 730, 891, 1088, 1318, 1596, 1932, 2326, 2797, 3360, 4020, 4804, 5735, 6824, 8108, 9624, 11392, 13468, 15904, 18737, 22048, 25914, 30400, 35619, 41686
Offset: 1

Views

Author

Clark Kimberling, Feb 27 2014

Keywords

Comments

Also, the number of partitions p of n such that (1/2)*max(p) is a part of p.
Also the number of even-length integer partitions of n with distinct middle parts. For example, the partition (4,3,2,1) has middle parts {2,3} so is counted under a(10), but (3,2,2,1) has middle parts {2,2} so is not counted under a(8). - Gus Wiseman, May 13 2023

Examples

			a(6) counts these partitions:  51, 42, 2211 which all have an even number of parts, and their medians 3, 3 and 1.5 are not present. Note that the partitions 33 and 3111, although having an even number of parts, are not included in the count of a(6), but instead in that of A238478(6), as their medians, 3 for the former and 1 for the latter, are present in those partitions.
		

Crossrefs

The complement is A238478, ranks A362618.
For mean instead of median we have A327472, complement A237984.
These partitions have ranks A362617.
A000041 counts integer partitions, even-length A027187.
A325347 counts partitions with integer median, complement A307683.
A359893/A359901/A359902 count partitions by median.
A359908 ranks partitions with integer median, complement A359912.

Programs

  • Mathematica
    Table[Count[IntegerPartitions[n], p_ /; !MemberQ[p, Median[p]]], {n, 40}]
    (* also *)
    Table[Count[IntegerPartitions[n], p_ /; MemberQ[p, Max[p]/2]], {n, 50}]
  • PARI
    my(q='q+O('q^50)); concat([0,0], Vec(sum(n=1,17,q^(3*n)/prod(k=1,2*n,1-q^k)))) \\ David Radcliffe, Jun 25 2025
  • Python
    from sympy.utilities.iterables import partitions
    def A238479(n): return sum(1 for p in partitions(n) if (m:=max(p,default=0))&1^1 and m>>1 in p) # Chai Wah Wu, Sep 21 2023
    

Formula

a(n) = A000041(n) - A238478(n).
For all n, A027187(n) >= a(n). [Because when a partition of n has an odd number of parts, then it is not counted by this sequence (cf. A238478) and also some of the partitions with an even number of parts might be excluded here. Cf. Examples.] - Antti Karttunen, Feb 27 2014
From Jeremy Lovejoy, Sep 29 2022: (Start)
G.f.: Sum_{n>=1} q^(3*n)/Product_{k=1..2*n} (1-q^k).
a(n) ~ Pi/(2^(17/4)*3^(3/4)*n^(5/4))*exp(Pi*sqrt(2*n/3)). Proved by Blecher and Knopfmacher. (End)
a(n) = A087897(2*n) = A035294(n) - A078408(n-1). - Mathew Englander, May 20 2023

A238478 Number of partitions of n whose median is a part.

Original entry on oeis.org

1, 2, 2, 4, 5, 8, 11, 17, 22, 32, 43, 59, 78, 105, 136, 181, 233, 302, 386, 496, 626, 796, 999, 1255, 1564, 1951, 2412, 2988, 3674, 4516, 5524, 6753, 8211, 9984, 12086, 14617, 17617, 21211, 25450, 30514, 36475, 43550, 51869, 61707, 73230, 86821, 102706
Offset: 1

Views

Author

Clark Kimberling, Feb 27 2014

Keywords

Comments

Also the number of integer partitions of n with a unique middle part. This means that either the length is odd or the two middle parts are equal. For example, the partition (4,3,2,1) has middle parts {2,3} so is not counted under a(10), but (3,2,2,1) has middle parts {2,2} so is counted under a(8). - Gus Wiseman, May 13 2023

Examples

			a(6) counts these partitions:  6, 411, 33, 321, 3111, 222, 21111, 111111.
		

Crossrefs

For mean instead of median we have A237984, ranks A327473.
The complement is counted by A238479, ranks A362617.
These partitions have ranks A362618.
A000041 counts integer partitions.
A325347 counts partitions with integer median, complement A307683.
A359893/A359901/A359902 count partitions by median.
A359908 ranks partitions with integer median, complement A359912.

Programs

  • Mathematica
    Table[Count[IntegerPartitions[n], p_ /; MemberQ[p, Median[p]]], {n, 40}]

Formula

a(n) + A238479(n) = A000041(n).
For all n, a(n) >= A027193(n) (because when a partition of n has an odd number of parts, its median is simply the part at the middle). - Antti Karttunen, Feb 27 2014
a(n) = A078408(n-1) - A282893(n). - Mathew Englander, May 24 2023

A362618 Numbers whose prime factorization has either (1) odd length, or (2) equal middle parts.

Original entry on oeis.org

2, 3, 4, 5, 7, 8, 9, 11, 12, 13, 16, 17, 18, 19, 20, 23, 24, 25, 27, 28, 29, 30, 31, 32, 37, 40, 41, 42, 43, 44, 45, 47, 48, 49, 50, 52, 53, 54, 56, 59, 61, 63, 64, 66, 67, 68, 70, 71, 72, 73, 75, 76, 78, 79, 80, 81, 83, 88, 89, 90, 92, 96, 97, 98, 99, 101
Offset: 1

Views

Author

Gus Wiseman, May 10 2023

Keywords

Comments

Also numbers n whose median prime factor is a prime factor of n.

Examples

			The prime factorization of 90 is 2*3*3*5, with middle parts (3,3), so 90 is in the sequence.
		

Crossrefs

Partitions of this type are counted by A238478.
The complement (without 1) is A362617, counted by A238479.
A027746 lists prime factors, A112798 indices, length A001222, sum A056239.
A359178 ranks partitions with a unique co-mode, counted by A362610.
A359893 counts partitions by median.
A359908 ranks partitions with integer median, counted by A325347.
A359912 ranks partitions with non-integer median, counted by A307683.
A362611 ranks modes in prime factorization, counted by A362614.
A362621 ranks partitions with median equal to maximum, counted by A053263.
A362622 ranks partitions whose maximum is a middle part, counted by A237824.

Programs

  • Mathematica
    prifacs[n_]:=If[n==1,{},Flatten[ConstantArray@@@FactorInteger[n]]];
    Select[Range[2,100],MemberQ[prifacs[#],Median[prifacs[#]]]&]

A363219 Twice the median of the conjugate of the integer partition with Heinz number n.

Original entry on oeis.org

0, 2, 2, 4, 2, 3, 2, 6, 4, 2, 2, 4, 2, 2, 4, 8, 2, 5, 2, 2, 3, 2, 2, 5, 4, 2, 6, 2, 2, 4, 2, 10, 2, 2, 4, 6, 2, 2, 2, 2, 2, 3, 2, 2, 6, 2, 2, 6, 4, 4, 2, 2, 2, 7, 4, 2, 2, 2, 2, 4, 2, 2, 4, 12, 3, 2, 2, 2, 2, 4, 2, 7, 2, 2, 6, 2, 4, 2, 2, 2, 8, 2, 2, 3, 2, 2
Offset: 1

Views

Author

Gus Wiseman, May 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). Since the denominator is always 1 or 2, the median can be represented as an integer by multiplying by 2.
The Heinz number of a partition (y_1,...,y_k) is prime(y_1)*...*prime(y_k). This gives a bijective correspondence between positive integers and integer partitions.

Examples

			The partition (4,2,1) has Heinz number 42 and conjugate (3,2,1,1) with median 3/2, so a(42) = 3.
		

Crossrefs

Twice the row media of A321649 or A321650.
For mean instead of twice median we have A326839/A326840.
This is the conjugate version of A360005.
A000700 counts self-conjugate partitions, ranked by A088902 (cf. A258116).
A056239 adds up prime indices, row sums of A112798 and A296150.
A122111 is partition conjugation in terms of Heinz numbers.
A124010 gives prime signature, sorted A118914, length A001221, sum A001222.
A352491 gives n minus Heinz number of conjugate.
A363220 counts partitions with same median as conjugate.

Programs

  • Mathematica
    prix[n_]:=If[n==1,{},Flatten[Cases[FactorInteger[n],{p_,k_}:>Table[PrimePi[p],{k}]]]];
    conj[y_]:=If[Length[y]==0,y,Table[Length[Select[y,#>=k&]],{k,1,Max[y]}]];
    Table[If[n==1,0,2*Median[conj[prix[n]]]],{n,100}]

A363220 Number of integer partitions of n whose conjugate has the same median.

Original entry on oeis.org

1, 0, 1, 1, 1, 3, 3, 8, 8, 12, 12, 15, 21, 27, 36, 49, 65, 85, 112, 149, 176, 214, 257, 311, 378, 470, 572, 710, 877, 1080, 1322, 1637, 1983, 2416, 2899, 3465, 4107, 4891, 5763, 6820, 8071, 9542, 11289, 13381, 15808, 18710, 22122, 26105, 30737, 36156, 42377
Offset: 1

Views

Author

Gus Wiseman, May 29 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 partition y = (4,3,1,1) has median 2, and its conjugate (4,2,2,1) also has median 2, so y is counted under a(9).
The a(1) = 1 through a(9) = 8 partitions:
  (1)  .  (21)  (22)  (311)  (321)   (511)    (332)     (333)
                             (411)   (4111)   (422)     (711)
                             (3111)  (31111)  (611)     (4221)
                                              (3311)    (4311)
                                              (4211)    (6111)
                                              (5111)    (51111)
                                              (41111)   (411111)
                                              (311111)  (3111111)
		

Crossrefs

For mean instead of median we have A047993.
For product instead of median we have A325039, ranks A325040.
For union instead of conjugate we have A360245, complement A360244.
Median of conjugate by rank is A363219.
These partitions are ranked by A363261.
A000700 counts self-conjugate partitions, ranks A088902.
A046682 and A352487-A352490 pertain to excedance set.
A122111 represents partition conjugation.
A325347 counts partitions with integer median.
A330644 counts non-self-conjugate partitions (twice A000701), ranks A352486.
A352491 gives n minus Heinz number of conjugate.

Programs

  • Mathematica
    conj[y_]:=If[Length[y]==0,y,Table[Length[Select[y,#>=k&]],{k,1,Max[y]}]];
    Table[Length[Select[IntegerPartitions[n],Median[#]==Median[conj[#]]&]],{n,30}]
Showing 1-5 of 5 results.