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

A064914 Number of ordered biquanimous partitions of 2n.

Original entry on oeis.org

1, 1, 5, 23, 105, 449, 1902, 7828, 31976, 129200, 520425, 2088217, 8371186, 33514797, 134140430, 536699674, 2147154667, 8589198795, 34358341823, 137435830265, 549749857574, 2199010044813, 8796067657649, 35184315676573, 140737380485376, 562949713881526
Offset: 0

Views

Author

Christian G. Bower, Oct 12 2001

Keywords

Comments

A biquanimous partition is one that can be bisected into two equal sized parts: e.g. 3+2+1 is a biquanimous partition of 6 as it contains 3 and 2+1, but 5+1 is not.

Examples

			From _Gus Wiseman_, Apr 19 2024: (Start)
The a(0) = 1 through a(3) = 23 biquanimous compositions:
  ()  (11)  (22)    (33)
            (112)   (123)
            (121)   (132)
            (211)   (213)
            (1111)  (231)
                    (312)
                    (321)
                    (1113)
                    (1122)
                    (1131)
                    (1212)
                    (1221)
                    (1311)
                    (2112)
                    (2121)
                    (2211)
                    (3111)
                    (11112)
                    (11121)
                    (11211)
                    (12111)
                    (21111)
                    (111111)
(End)
		

Crossrefs

The unordered version (integer partitions) is A002219, ranks A357976.
The unordered complement is A371795, even case A006827, ranks A371731.
The complement is counted by A371956.
These compositions have ranks A372120, complement A372119.
A237258 (aerated) counts biquanimous strict partitions, ranks A357854.
A321142 and A371794 count non-biquanimous strict partitions.
A371791 counts biquanimous sets, differences A232466.
A371792 counts non-biquanimous sets, differences A371793.

Programs

  • Mathematica
    Table[Length[Select[Join@@Permutations/@IntegerPartitions[2n], MemberQ[Total/@Subsets[#],n]&]],{n,0,5}] (* Gus Wiseman, Apr 19 2024 *)

Extensions

More terms from Alois P. Heinz, Jun 12 2017

A372119 Numbers k such that the k-th composition in standard order is not biquanimous.

Original entry on oeis.org

1, 2, 4, 5, 6, 7, 8, 9, 12, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 40, 42, 48, 49, 56, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 82, 83, 84, 85, 86, 87, 88, 89, 90, 91, 92, 93, 94, 95, 96
Offset: 1

Views

Author

Gus Wiseman, Apr 20 2024

Keywords

Comments

The k-th composition in standard order (graded reverse-lexicographic, A066099) is obtained by taking the set of positions of 1's in the reversed binary expansion of k, prepending 0, taking first differences, and reversing again. This gives a bijective correspondence between nonnegative integers and integer compositions.
A finite multiset of numbers is defined to be biquanimous iff it can be partitioned into two multisets with equal sums. Biquanimous partitions are counted by A002219 and ranked by A357976.

Examples

			The terms and corresponding compositions begin:
   1: (1)
   2: (2)
   4: (3)
   5: (2,1)
   6: (1,2)
   7: (1,1,1)
   8: (4)
   9: (3,1)
  12: (1,3)
  16: (5)
  17: (4,1)
  18: (3,2)
  19: (3,1,1)
  20: (2,3)
  21: (2,2,1)
  22: (2,1,2)
  23: (2,1,1,1)
		

Crossrefs

The unordered complement is A357976, counted by A002219.
The unordered version is A371731, counted by A371795, even case A006827.
These compositions are counted by A371956.
The complement is A372120, counted by A064914.
A237258 (aerated) counts biquanimous strict partitions, ranks A357854.
A321142 and A371794 count non-biquanimous strict partitions.
A371791 counts biquanimous sets, differences A232466.
A371792 counts non-biquanimous sets, differences A371793.

Programs

  • Mathematica
    stc[n_]:=Differences[Prepend[Join @@ Position[Reverse[IntegerDigits[n,2]],1],0]]//Reverse;
    Select[Range[0,100],!MemberQ[Total/@Subsets[stc[#]], Total[stc[#]]/2]&]

A372120 Numbers k such that the k-th composition in standard order is biquanimous.

Original entry on oeis.org

0, 3, 10, 11, 13, 14, 15, 36, 37, 38, 39, 41, 43, 44, 45, 46, 47, 50, 51, 52, 53, 54, 55, 57, 58, 59, 60, 61, 62, 63, 136, 137, 138, 139, 140, 141, 142, 143, 145, 147, 149, 150, 151, 152, 153, 154, 155, 156, 157, 158, 159, 162, 163, 165, 166, 167, 168, 169
Offset: 1

Views

Author

Gus Wiseman, Apr 20 2024

Keywords

Comments

The k-th composition in standard order (graded reverse-lexicographic, A066099) is obtained by taking the set of positions of 1's in the reversed binary expansion of k, prepending 0, taking first differences, and reversing again. This gives a bijective correspondence between nonnegative integers and integer compositions.
A finite multiset of numbers is defined to be biquanimous iff it can be partitioned into two multisets with equal sums. Biquanimous partitions are counted by A002219 and ranked by A357976.

Examples

			The terms and corresponding compositions begin:
   0: ()
   3: (1,1)
  10: (2,2)
  11: (2,1,1)
  13: (1,2,1)
  14: (1,1,2)
  15: (1,1,1,1)
  36: (3,3)
  37: (3,2,1)
  38: (3,1,2)
  39: (3,1,1,1)
  41: (2,3,1)
  43: (2,2,1,1)
  44: (2,1,3)
  45: (2,1,2,1)
  46: (2,1,1,2)
  47: (2,1,1,1,1)
  50: (1,3,2)
  51: (1,3,1,1)
  52: (1,2,3)
  53: (1,2,2,1)
  54: (1,2,1,2)
		

Crossrefs

These compositions are counted by A064914.
The unordered version (integer partitions) is A357976, counted by A002219.
The unordered complement is A371731, counted by A371795, even case A006827.
The complement is A372119, counted by A371956.
A237258 (aerated) counts biquanimous strict partitions, ranks A357854.
A321142 and A371794 count non-biquanimous strict partitions.
A371791 counts biquanimous sets, differences A232466.
A371792 counts non-biquanimous sets, differences A371793.

Programs

  • Mathematica
    stc[n_]:=Differences[Prepend[Join @@ Position[Reverse[IntegerDigits[n,2]],1],0]]//Reverse;
    Select[Range[0,100],MemberQ[Total/@Subsets[stc[#]], Total[stc[#]]/2]&]
Showing 1-3 of 3 results.