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.

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

This page as a plain text file.
%I A262171 #4 Sep 14 2015 17:21:53
%S A262171 1,1,2,5,20,87,522,3271,26168,214955,2149549,21881092,262569097,
%T A262171 3191307394,44674222343,631473609984,10100709895340,162823295801791,
%U A262171 2928983654856296,53036572897985517,1059539775650223369,21293220263695186990,467627502721031824736
%N A262171 Number of permutations p of [n] such that the up-down signature of 0,p has nonnegative partial sums with a maximal value <= 9.
%H A262171 Alois P. Heinz, <a href="/A262171/b262171.txt">Table of n, a(n) for n = 0..200</a>
%F A262171 a(n) = A262163(n,9).
%p A262171 b:= proc(u, o, c) option remember; `if`(c<0 or c>9, 0, `if`(u+o=0,
%p A262171        x^c, (p-> add(coeff(p, x, i)*x^max(i, c), i=0..9))(add(
%p A262171        b(u-j, o-1+j, c-1), j=1..u)+add(b(u+j-1, o-j, c+1), j=1..o))))
%p A262171     end:
%p A262171 a:= n-> (p-> add(coeff(p, x, i), i=0..min(n, 9)))(b(0, n, 0)):
%p A262171 seq(a(n), n=0..25);
%Y A262171 Column k=9 of A262163.
%K A262171 nonn
%O A262171 0,3
%A A262171 _Alois P. Heinz_, Sep 13 2015