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”).

A193316
Number of basic forbidden patterns of length n of the map f(x)=4x(1-x) on the unit interval.
0
0, 0, 1, 5, 9, 28, 53, 110, 229, 474
OFFSET
1,4
COMMENTS
A permutation pi is a forbidden pattern if there is no x in [0,1] such that the values x,f(x),f(f(x)),...,f^{n-1}(x) are in the same relative order as pi_1,pi_2,...,pi_n. A forbidden pattern is basic if it is minimally forbidden, that is, the patterns obtained by removing pi_1 or pi_n are not forbidden.
a(n) is also the number of basic forbidden patterns of length n of the tent map x -> 1-|1-2x| in [0,1].
LINKS
S. Elizalde and Y. Liu, On basic forbidden patterns of functions, arXiv:0909.2277 [math.CO], 2009.
S. Elizalde and Y. Liu, On basic forbidden patterns of functions, Discrete Appl. Math. 159 (2011), 1207-1216.
EXAMPLE
a(3) = 1 because the only basic forbidden pattern of length 3 is 321.
a(4) = 5 because the basic forbidden patterns of length 4 are 1423, 2134, 2143, 3142, 4231.
CROSSREFS
Sequence in context: A272287 A272315 A301747 * A026587 A147367 A147230
KEYWORD
nonn,more
AUTHOR
Sergi Elizalde, Jul 22 2011
STATUS
approved