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.

A316397 Number of permutations p of [n] such that the up-down signature of 0,p has nonnegative partial sums with a maximal value of ten.

This page as a plain text file.
%I A316397 #5 Jul 01 2018 18:47:38
%S A316397 1,10,4127,45562,4719041,58003461,3795919780,52052335254,
%T A316397 2772611610514,42268105493955,2037044419366071,34333238955892416,
%U A316397 1578674337291922196,29239755067140936242,1321207703588407017510,26733500408009431631728,1208079945873987947779946
%N A316397 Number of permutations p of [n] such that the up-down signature of 0,p has nonnegative partial sums with a maximal value of ten.
%H A316397 Alois P. Heinz, <a href="/A316397/b316397.txt">Table of n, a(n) for n = 10..451</a>
%F A316397 a(n) = A262172(n) - A262171(n).
%p A316397 b:= proc(u, o, c, k) option remember;
%p A316397       `if`(c<0 or c>k, 0, `if`(u+o=0, 1,
%p A316397        add(b(u-j, o-1+j, c+1, k), j=1..u)+
%p A316397        add(b(u+j-1, o-j, c-1, k), j=1..o)))
%p A316397     end:
%p A316397 a:= n-> b(n, 0$2, 10)-b(n, 0$2, 9):
%p A316397 seq(a(n), n=10..26);
%Y A316397 Column k=10 of A258829.
%Y A316397 Cf. A262171, A262172.
%K A316397 nonn
%O A316397 10,2
%A A316397 _Alois P. Heinz_, Jul 01 2018