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

A124763 Number of non-rises (levels or falls) for compositions in standard order.

Original entry on oeis.org

0, 0, 0, 1, 0, 1, 0, 2, 0, 1, 1, 2, 0, 1, 1, 3, 0, 1, 1, 2, 0, 2, 1, 3, 0, 1, 1, 2, 1, 2, 2, 4, 0, 1, 1, 2, 1, 2, 1, 3, 0, 1, 2, 3, 1, 2, 2, 4, 0, 1, 1, 2, 0, 2, 1, 3, 1, 2, 2, 3, 2, 3, 3, 5, 0, 1, 1, 2, 1, 2, 1, 3, 0, 2, 2, 3, 1, 2, 2, 4, 0, 1, 1, 2, 1, 3, 2, 4, 1, 2, 2, 3, 2, 3, 3, 5, 0, 1, 1, 2, 1, 2, 1, 3, 0
Offset: 0

Views

Author

Keywords

Comments

The standard order of compositions is given by A066099.
A composition of n is a finite sequence of positive integers summing to n. The k-th composition in standard order (row k of 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. a(n) is one fewer than the number of maximal strictly increasing runs in this composition. Alternatively, a(n) is the number of weak descents in the same composition. For example, the strictly increasing runs of the 1234567th composition are ((3),(2),(1,2),(2),(1,2,5),(1),(1),(1)), so a(1234567) = 8 - 1 = 7. The 7 weak descents together with the strict ascents are: 3 >= 2 >= 1 < 2 >= 2 >= 1 < 2 < 5 >= 1 >= 1 >= 1. - Gus Wiseman, Apr 08 2020

Examples

			Composition number 11 is 2,1,1; 2>=1>=1, so a(11) = 2.
The table starts:
  0
  0
  0 1
  0 1 0 2
  0 1 1 2 0 1 1 3
  0 1 1 2 0 2 1 3 0 1 1 2 1 2 2 4
  0 1 1 2 1 2 1 3 0 1 2 3 1 2 2 4 0 1 1 2 0 2 1 3 1 2 2 3 2 3 3 5
		

Crossrefs

Cf. A029931, A066099, A124760, A124761, A124764, A011782 (row lengths), A045883 (row sums), A238343, A333220.
Compositions of n with k weak descents are A333213.
Positions of zeros are A333255.
All of the following pertain to compositions in standard order (A066099):
- Length is A000120.
- Partial sums from the right are A048793.
- Sum is A070939.
- Weakly decreasing compositions are A114994.
- Adjacent equal pairs are counted by A124762.
- Weakly decreasing runs are counted by A124765.
- Weakly increasing runs are counted by A124766.
- Equal runs are counted by A124767.
- Strictly increasing runs are counted by A124768.
- Strictly decreasing runs are counted by A124769.
- Weakly increasing compositions are A225620.
- Reverse is A228351 (triangle).
- Strict compositions are A233564.
- Initial intervals are A246534.
- Constant compositions are A272919.
- Normal compositions are A333217.
- Permutations are A333218.
- Heinz number is A333219.
- Strictly decreasing compositions are A333255.
- Strictly increasing compositions are A333256.
- Anti-runs are A333489.

Programs

  • Mathematica
    stc[n_]:=Differences[Prepend[Join@@Position[Reverse[IntegerDigits[n,2]],1],0]]//Reverse;
    Table[Length[Select[Partition[stc[n],2,1],GreaterEqual@@#&]],{n,0,100}] (* Gus Wiseman, Apr 08 2020 *)

Formula

For a composition b(1),...,b(k), a(n) = Sum_{1<=i=1=b(i+1)} 1.
a(n) = A124761(n) + A124762(n).
For n > 0, a(n) = A124768(n) - 1. - Gus Wiseman, Apr 08 2020

A383549 Number of rises in all compositions of n with parts in {1,2,3} and adjacent differences in {-1,1}.

Original entry on oeis.org

0, 0, 0, 1, 1, 2, 5, 3, 9, 11, 10, 24, 21, 30, 50, 43, 75, 93, 96, 161, 170, 215, 312, 323, 456, 574, 639, 906, 1046, 1276, 1710, 1935, 2501, 3135, 3642, 4760, 5699, 6893, 8823, 10401, 12952, 16079, 19104, 24002, 29097, 35165, 43865, 52628, 64503, 79363, 95329
Offset: 0

Views

Author

John Tyler Rascoe, Apr 29 2025

Keywords

Comments

A rise is any pair of parts (p_{i-1},p_i) with p_{i-1} < p_i.
By reversal a(n) is also the number of descents in all compositions of n of this kind.

Examples

			For n = 6 the following compositions have 5 rises: (1,2,1,2), (1,2,3), (2,1,2,1), (3,2,1).
		

Crossrefs

Programs

  • PARI
    A_x(N) = {my(x='x+O('x^N)); concat([0,0,0], Vec(x^3*(1 + x^2)^2*(1 + x + x^3)/(1 - x^3 - x^5)^2))}
    A_x(40)

Formula

G.f.: x^3*(1 + x^2)^2*(1 + x + x^3)/(1 - x^3 - x^5)^2.
Previous Showing 11-12 of 12 results.