login
This site is supported by donations to The OEIS Foundation.

 

Logo

Please make a donation to keep the OEIS running. We are now in our 55th year. In the past year we added 12000 new sequences and reached 8000 citations (which often say "discovered thanks to the OEIS"). We need to raise money to hire someone to manage submissions, which would reduce the load on our editors and speed up editing.
Other ways to donate

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A317784 Number of ascent sequences of length n avoiding the pattern 0000. 2
1, 1, 2, 5, 14, 47, 180, 773, 3701, 19488, 111890, 695786, 4656185, 33356828, 254675642, 2063984616, 17694054723, 159958176316, 1520689121858, 15165205111010 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,3

LINKS

Table of n, a(n) for n=0..19.

P. Duncan and Einar Steingrimsson, Pattern avoidance in ascent sequences, arXiv:1109.3641, 2011

FORMULA

a(n) <= A022493(n) with equality only for n < 4.

MAPLE

b:= proc(n, i, t, p) option remember; `if`(n=0, 1, add(

      `if`(coeff(p, x, j)=3, 0, b(n-1, j, t+

      `if`(j>i, 1, 0), p+x^j)), j=1..t+1))

    end:

a:= n-> b(n, 0$3):

seq(a(n), n=0..12);

CROSSREFS

Column k=3 of A294220.

Cf. A022493.

Sequence in context: A287888 A115276 A327702 * A096402 A007268 A326898

Adjacent sequences:  A317781 A317782 A317783 * A317785 A317786 A317787

KEYWORD

nonn,more

AUTHOR

Alois P. Heinz, Aug 06 2018

EXTENSIONS

a(18) from Vaclav Kotesovec, Aug 20 2018

a(19) from Vaclav Kotesovec, Aug 23 2018

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified December 7 00:09 EST 2019. Contains 329812 sequences. (Running on oeis4.)