cp's OEIS Frontend

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

%I A264916 #19 Nov 09 2017 11:39:27
%S A264916 1,1,2,12,110,1380,21931,422128,9544164,247924425,7276062838,
%T A264916 238094692473,8595519551905,339369780700496,14547197878632067,
%U A264916 672813893127964088,33396560680565891888,1770862858604836365591,99902715110909008145856,5974701996798223000294793
%N A264916 Number of n-ascent sequences of length n with no consecutive repeated letters.
%H A264916 Alois P. Heinz, <a href="/A264916/b264916.txt">Table of n, a(n) for n = 0..125</a>
%H A264916 S. Kitaev, J. Remmel, <a href="https://arxiv.org/abs/1503.00914">p-Ascent Sequences</a>, arXiv:1503.00914 [math.CO], 2015.
%F A264916 a(n) = A264909(n,n).
%F A264916 a(n) ~ c * n! * d^n / n^(3/2), where d = 3.4022754519536669374151613210346790003... and c = 0.34285335011727623741388891327237... - _Vaclav Kotesovec_, Aug 14 2017
%p A264916 b:= proc(n, k, i, t) option remember; `if`(n<1, 1, add(
%p A264916       `if`(j=i, 0, b(n-1, k, j, t+`if`(j>i, 1, 0))), j=0..t+k))
%p A264916     end:
%p A264916 a:= n-> b(n-1, n, 0$2):
%p A264916 seq(a(n), n=0..25);
%t A264916 b[n_, k_, i_, t_] := b[n, k, i, t] = If[n < 1, 1, Sum[If[j == i, 0, b[n - 1, k, j, t + If[j > i, 1, 0]]], {j, 0, t + k}]];
%t A264916 a[n_] := b[n - 1, n, 0, 0];
%t A264916 Table[a[n], {n, 0, 25}] (* _Jean-François Alcover_, Nov 09 2017, after _Alois P. Heinz_ *)
%Y A264916 Main diagonal of A264909.
%K A264916 nonn
%O A264916 0,3
%A A264916 _Alois P. Heinz_, Nov 28 2015