A193285 Number of forbidden patterns of length n of the map f(x) = 4x(1-x) on the unit interval. 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.

0, 0, 0, 1, 12, 89, 645, 4862, 39906, 361931, 3626663, 39912033

Offset: 0

Author

Sergi Elizalde, Jul 20 2011

Keywords

• nonn
• more

Comments

a(n) is also the number of forbidden patterns of length n of the tent map x -> 1-|1-2x| in [0,1].

Examples

			a(3) = 1 because the only forbidden pattern of length 3 is 321.
		

Links

• S. Elizalde and Y. Liu, On basic forbidden patterns of functions, Discrete Appl. Math. 159 (2011), 1207-1216.

Crossrefs

Cf. A000142, A193284 (allowed patterns).

Formula

a(n) = n! - A193284(n).

Extensions

a(0)=0 prepended by Alois P. Heinz, Mar 02 2020