1,2

Apparently Micah Coleman (U. Florida, Gainesville) may have solved part of Wilf's problem. He showed that limit of f(n)^(1/n)=2, by a construction.

Full list of permutations that attain the maximum number of patterns, up to reversal: 1: (1) 2: (12) 3: (132) (213) 4: (2413) 5: (25314) 6: (253614) (264153) (361425) (426315) 7: (2574163) (3614725) (3624715) (3714625) (5274136) 8: (25836147) (36185274) (38527416) (52741836) 9: (385174926) (481639527). - Joshua Zucker, Jul 07 2006

Micah Coleman, An (almost) optimal answer to a question by Herbert S. Wilf, arXiv:math/0404181 [math.CO], 2004.

Micah Spencer Coleman, Asymptotic enumeration in pattern avoidance and in the theory of set partitions and asymptotic uniformity [From N. J. A. Sloane, Sep 18 2010]

H. S. Wilf, Problem 414, Discrete Math. 272 (2003), 303.

n=2: (12) has one pattern of length 1 and one of length 2 and a(2) = 2.

n=4: (2413) has one pattern of length 1, 2 of length 2 (namely 24 and 21), 4 of length 3 (namely 243, 241, 213, 413) and one of length 4 (namely 2413), and this is maximal, and a(4)=8.

A092603(n) is an upper bound.

Sequence in context: A171857 A190160 A332052 * A271364 A036621 A001383

Adjacent sequences: A088529 A088530 A088531 * A088533 A088534 A088535

nonn,nice,more

N. J. A. Sloane, Nov 20 2003

a(8)-a(9) from Joshua Zucker, Jul 07 2006

a(10)-a(11) from Jon Hart, Aug 08 2015

approved