|
%I #24 Oct 25 2017 09:59:49
%S 1,1,4,16,58,190,564,1526,3794,8747,18869,38402,74273,137372,244271,
%T 419488,698415,1131045,1786650,2759580,4176372,6204378,9062142,
%U 13031778,18473624,25843471,35712691,48791614,65956531,88280728,117069985,153903004,200677261
%N Number of 4-ascent sequences of length n that avoid the pattern 00.
%H Alois P. Heinz, <a href="/A263851/b263851.txt">Table of n, a(n) for n = 0..1000</a>
%H Sergey Kitaev, J. B. Remmel, <a href="https://pure.strath.ac.uk/portal/files/46917816/Kitaev_Remmel_JC2016_a_note_on_p_ascent_sequences.pdf">A note on p-Ascent Sequences</a>, Preprint, 2016
%H S. Kitaev, J. Remmel, <a href="http://arxiv.org/abs/1503.00914">p-Ascent Sequences</a>, arXiv preprint arXiv:1503.00914 [math.CO], 2015.
%F G.f.: -(4*x^9 -27*x^8 +82*x^7 -152*x^6 +192*x^5 -168*x^4 +99*x^3 -39*x^2 +9*x-1) / (x-1)^10. - _Alois P. Heinz_, Nov 19 2015
%Y Cf. A261383.
%K nonn,easy
%O 0,3
%A _N. J. A. Sloane_, Nov 18 2015
%E a(9)-a(32) from _Alois P. Heinz_, Nov 19 2015
|
