login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A242352 Number T(n,k) of isoscent sequences of length n with exactly k descents; triangle T(n,k), n>=0, 0<=k<=n+2-ceiling(2*sqrt(n+1)), read by rows. 13

%I #34 Feb 09 2015 10:33:32

%S 1,1,2,4,1,9,6,21,29,2,51,124,28,127,499,241,10,323,1933,1667,216,1,

%T 835,7307,10142,2765,98,2188,27166,56748,27214,2637,22,5798,99841,

%U 299485,227847,44051,1546,2,15511,363980,1514445,1708700,563444,46947,570

%N Number T(n,k) of isoscent sequences of length n with exactly k descents; triangle T(n,k), n>=0, 0<=k<=n+2-ceiling(2*sqrt(n+1)), read by rows.

%C An isoscent sequence of length n is an integer sequence [s(1),...,s(n)] with s(1) = 0 and 0 <= s(i) <= 1 plus the number of level steps in [s(1),...,s(i)].

%C Columns k=0-10 give: A001006, A243474, A243475, A243476, A243477, A243478, A243479, A243480, A243481, A243482, A243483.

%C Row sums give A000110.

%C Last elements of rows give A243484.

%H Joerg Arndt and Alois P. Heinz, <a href="/A242352/b242352.txt">Rows n = 0..114, flattened</a>

%e T(4,0) = 9: [0,0,0,0], [0,0,0,1], [0,0,0,2], [0,0,0,3], [0,0,1,1], [0,0,1,2], [0,0,2,2], [0,1,1,1], [0,1,1,2].

%e T(4,1) = 6: [0,0,1,0], [0,0,2,0], [0,0,2,1], [0,1,0,0], [0,1,0,1], [0,1,1,0].

%e T(5,2) = 2: [0,0,2,1,0], [0,1,0,1,0].

%e Triangle T(n,k) begins:

%e : 1;

%e : 1;

%e : 2;

%e : 4, 1;

%e : 9, 6;

%e : 21, 29, 2;

%e : 51, 124, 28;

%e : 127, 499, 241, 10;

%e : 323, 1933, 1667, 216, 1;

%e : 835, 7307, 10142, 2765, 98;

%e : 2188, 27166, 56748, 27214, 2637, 22;

%p b:= proc(n, i, t) option remember; `if`(n<1, 1, expand(add(

%p `if`(j<i, x, 1) *b(n-1, j, t+`if`(j=i, 1, 0)), j=0..t+1)))

%p end:

%p T:= n-> (p-> seq(coeff(p, x, i), i=0..degree(p)))(b(n-1, 0$2)):

%p seq(T(n), n=0..15);

%t b[n_, i_, t_] := b[n, i, t] = If[n<1, 1, Expand[Sum[If[j<i, x, 1]*b[n-1, j, t + If[j == i, 1, 0]], {j, 0, t+1}]]]; T[n_] := Function[{p}, Table[ Coefficient[ p, x, i], {i, 0, Exponent[p, x]}]][b[n-1, 0, 0]]; Table[T[n], {n, 0, 15}] // Flatten (* _Jean-François Alcover_, Feb 09 2015, after Maple *)

%Y Cf. A048993 (for counting level steps), A242351 (for counting ascents), A137251 (ascent sequences counting ascents), A238858 (ascent sequences counting descents), A242153 (ascent sequences counting level steps), A083479.

%K nonn,tabf

%O 0,3

%A _Joerg Arndt_ and _Alois P. Heinz_, May 11 2014

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 25 04:42 EDT 2024. Contains 371964 sequences. (Running on oeis4.)