Sequence: "The patterns of permutations"

[Rob Pratt]

It is A088532.
 
Also, I counted 16877 distinct patterns (not 16874) in the example permutation given on page 2 of the paper:
5 12 2 7 15 10 4 13 8 1 11 6 14 3 9.
 
Rob Pratt


	-----Original Message----- 
	From: N. J. A. Sloane [mailto:njas at research.att.com] 
	Sent: Fri 4/9/2004 3:33 PM 
	To: seqfan at ext.jussieu.fr 
	Cc: njas at research.att.com 
	Subject: Sequence: "The patterns of permutations"
	
	


	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