cp's OEIS Frontend

A264914 Number of 9-ascent sequences of length n with no consecutive repeated letters.

%I A264914 #12 Nov 09 2017 11:39:11
%S A264914 1,1,9,90,945,10440,121065,1470855,18688680,247924425,3428559573,
%T A264914 49353455856,738477897552,11471175099726,184755890053173,
%U A264914 3081830366508444,53182355345412138,948482464405185843,17465164002387664056,331740754587283644945,6494261833979742949884
%N A264914 Number of 9-ascent sequences of length n with no consecutive repeated letters.
%H A264914 Alois P. Heinz, <a href="/A264914/b264914.txt">Table of n, a(n) for n = 0..200</a>
%H A264914 S. Kitaev, J. Remmel, <a href="https://arxiv.org/abs/1503.00914">p-Ascent Sequences</a>, arXiv:1503.00914 [math.CO], 2015.
%p A264914 b:= proc(n, i, t) option remember; `if`(n<1, 1, add(
%p A264914       `if`(j=i, 0, b(n-1, j, t+`if`(j>i, 1, 0))), j=0..t+9))
%p A264914     end:
%p A264914 a:= n-> (b(n-1, 0$2)):
%p A264914 seq(a(n), n=0..30);
%t A264914 b[n_, i_, t_] := b[n, i, t] = If[n < 1, 1, Sum[If[j == i, 0, b[n - 1, j, t + If[j > i, 1, 0]]], {j, 0, t + 9}]]; a[n_] := b[n - 1, 0, 0];
%t A264914 Table[a[n], {n, 0, 30}] (* _Jean-François Alcover_, Nov 09 2017, after _Alois P. Heinz_ *)
%Y A264914 Column k=9 of A264909.
%K A264914 nonn
%O A264914 0,3
%A A264914 _Alois P. Heinz_, Nov 28 2015