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.

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

This page as a plain text file.
%I A316393 #5 Jul 01 2018 15:12:31
%S A316393 1,6,261,1890,52022,455231,11174035,116105272,2810232512,34036483163,
%T A316393 844691910962,11731978216291,303637667232802,4769379288424677,
%U A316393 129700918311614279,2277005590881369266,65261900211279910831,1267764017301809851710,38324737795523150842616
%N A316393 Number of permutations p of [n] such that the up-down signature of 0,p has nonnegative partial sums with a maximal value of six.
%H A316393 Alois P. Heinz, <a href="/A316393/b316393.txt">Table of n, a(n) for n = 6..452</a>
%F A316393 a(n) = A262168(n) - A262167(n).
%p A316393 b:= proc(u, o, c, k) option remember;
%p A316393       `if`(c<0 or c>k, 0, `if`(u+o=0, 1,
%p A316393        add(b(u-j, o-1+j, c+1, k), j=1..u)+
%p A316393        add(b(u+j-1, o-j, c-1, k), j=1..o)))
%p A316393     end:
%p A316393 a:= n-> b(n, 0$2, 6)-b(n, 0$2, 5):
%p A316393 seq(a(n), n=6..24);
%Y A316393 Column k=6 of A258829.
%Y A316393 Cf. A262167, A262168.
%K A316393 nonn
%O A316393 6,2
%A A316393 _Alois P. Heinz_, Jul 01 2018