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

A242507 Number of compositions of n, where the difference between the number of odd parts and the number of even parts is 9.

Original entry on oeis.org

1, 0, 9, 11, 45, 121, 243, 726, 1509, 3601, 8385, 17836, 40873, 87633, 188855, 409116, 859674, 1827160, 3832786, 7981398, 16644666, 34362355, 70866846, 145637147, 297814569, 608309130, 1237764177, 2512564769, 5090761029, 10286177231, 20750532587, 41778968976
Offset: 9

Views

Author

Alois P. Heinz, May 16 2014

Keywords

Comments

With offset 18 number of compositions of n, where the difference between the number of odd parts and the number of even parts is -9.

Crossrefs

Column k=9 of A242498.

Formula

Recurrence (for n>=13): (n-9)*(n+1)*(n+2)*(n+18)*(16*n^4 + 128*n^3 + 344*n^2 + 352*n - 104871)*a(n) = -2592*(n-10)*(n+1)*(n+3)*(n+17)*(2*n+3)*a(n-1) + 2*(n+2)*(16*n^7 + 272*n^6 + 2872*n^5 + 10928*n^4 - 103259*n^3 - 795505*n^2 - 7964385*n - 13572711)*a(n-2) + 2*(n+1)*(n+3)*(2*n+3)*(16*n^5 + 208*n^4 + 1008*n^3 + 3524*n^2 - 96349*n - 123786)*a(n-3) - (n-4)*(n+2)*(n+3)*(n+5)*(16*n^4 + 192*n^3 + 824*n^2 + 1488*n - 104031)*a(n-4). - Vaclav Kotesovec, May 20 2014

A242508 Number of compositions of n, where the difference between the number of odd parts and the number of even parts is 10.

Original entry on oeis.org

1, 0, 10, 12, 55, 144, 311, 936, 1989, 4928, 11557, 25340, 59025, 128576, 283100, 620976, 1327258, 2862528, 6080645, 12845064, 27102284, 56625624, 118144679, 245331648, 507035957, 1045854240, 2148159266, 4400962876, 8993987459, 18326508928, 37269909849
Offset: 10

Views

Author

Alois P. Heinz, May 16 2014

Keywords

Comments

With offset 20 number of compositions of n, where the difference between the number of odd parts and the number of even parts is -10.

Crossrefs

Column k=10 of A242498.

Formula

Recurrence (for n>=14): (n-10)*(n+20)*(2*n+3)*(2*n+5)*(n^4 + 10*n^3 + 35*n^2 + 50*n - 9976)*a(n) = -400*(n-11)*(n+2)*(n+19)*(2*n+3)*(2*n+7)*a(n-1) + 2*(2*n + 5)*(2*n^7 + 41*n^6 + 500*n^5 + 2585*n^4 - 16152*n^3 - 177396*n^2 - 1963520*n - 4094400)*a(n-2) + 2*(n+2)*(2*n+3)*(2*n+7)*(2*n^5 + 31*n^4 + 183*n^3 + 709*n^2 - 18145*n - 33100)*a(n-3) - (n-4)*(n+6)*(2*n+5)*(2*n+7)*(n^4 + 14*n^3 + 71*n^2 + 154*n - 9880)*a(n-4). - Vaclav Kotesovec, May 20 2014

A355321 Numbers k such that the k-th composition in standard order has the same number of even parts as odd.

Original entry on oeis.org

0, 5, 6, 17, 18, 20, 24, 43, 45, 46, 53, 54, 58, 65, 66, 68, 72, 80, 96, 139, 141, 142, 149, 150, 154, 163, 165, 166, 169, 172, 177, 178, 180, 184, 197, 198, 202, 209, 210, 212, 216, 226, 232, 257, 258, 260, 264, 272, 288, 320, 343, 347, 349, 350, 363, 365
Offset: 1

Views

Author

Gus Wiseman, Jun 28 2022

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.

Examples

			The terms together with their corresponding compositions begin:
   0: ()
   5: (2,1)
   6: (1,2)
  17: (4,1)
  18: (3,2)
  20: (2,3)
  24: (1,4)
  43: (2,2,1,1)
  45: (2,1,2,1)
  46: (2,1,1,2)
  53: (1,2,2,1)
  54: (1,2,1,2)
  58: (1,1,2,2)
  65: (6,1)
  66: (5,2)
  68: (4,3)
  72: (3,4)
  80: (2,5)
  96: (1,6)
		

Crossrefs

A subset of A001969 (evil numbers), complement A000069.
These compositions are counted by A098123, without multiplicity A242821.
The version for partitions is A325698, counted by A045931.
For partitions without multiplicity we have A325700, counted by A241638.
A047993 counts balanced partitions, ranked by A106529.
A108950/A108949 count partitions with more odd/even parts.
A130780/A171966 count partitions with more or as many odd/even parts.

Programs

  • Mathematica
    stc[n_]:=Differences[Prepend[Join@@ Position[Reverse[IntegerDigits[n,2]],1],0]]//Reverse;
    Select[Range[0,100],Count[stc[#],?EvenQ]==Count[stc[#],?OddQ]&]
Previous Showing 11-13 of 13 results.