login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A263851
Number of 4-ascent sequences of length n that avoid the pattern 00.
2
1, 1, 4, 16, 58, 190, 564, 1526, 3794, 8747, 18869, 38402, 74273, 137372, 244271, 419488, 698415, 1131045, 1786650, 2759580, 4176372, 6204378, 9062142, 13031778, 18473624, 25843471, 35712691, 48791614, 65956531, 88280728, 117069985, 153903004, 200677261
OFFSET
0,3
LINKS
Sergey Kitaev, J. B. Remmel, A note on p-Ascent Sequences, Preprint, 2016
S. Kitaev, J. Remmel, p-Ascent Sequences, arXiv preprint arXiv:1503.00914 [math.CO], 2015.
FORMULA
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
CROSSREFS
Cf. A261383.
Sequence in context: A283124 A282393 A034514 * A126644 A168583 A092688
KEYWORD
nonn,easy
AUTHOR
N. J. A. Sloane, Nov 18 2015
EXTENSIONS
a(9)-a(32) from Alois P. Heinz, Nov 19 2015
STATUS
approved