Sequence: "The patterns of permutations"

[N. J. A. Sloane]

John McKay points out that a paper on the Lanl arxiv today
mentions a nice-looking sequence which may or may not be in the
OEIS - could someone check?

The paper is math.CO/0404181

Date: Thu, 8 Apr 2004 02:41:49 GMT   (4kb)
An (almost) optimal answer to a question by Herb Wilf
Authors: Micah Coleman

    We present a class of permutations for which the number of distinctly ordered subsequences of each permutation approaches an almost
    optimal value as the length of the permutation grows to infinity. 


The sequence is what he calls h(n), which grows like 2^n, roughly.

(I wish people would give the sequence number when they
publish a paper dealing with a sequence!  And send it in if
it doesn't have one...)

NJAS