id:A033537 - OEIS Search Results

Search: id:A033537

Displaying 1-1 of 1 results found.

page 1

n(2n+5).

+0
14

0, 7, 18, 33, 52, 75, 102, 133, 168, 207, 250, 297, 348, 403, 462, 525, 592, 663, 738, 817, 900, 987, 1078, 1173, 1272, 1375, 1482, 1593, 1708, 1827, 1950, 2077, 2208, 2343, 2482, 2625, 2772, 2923, 3078 (list; graph; listen)

	OFFSET	`0,2`
	COMMENT	`Permutations avoiding 12-3 that contain the pattern 32-1 exactly once.` `a(n) = A014107(n) + 8*n^2; A100035(a(n)) = 3 for n>1. - Reinhard Zumkeller (reinhard.zumkeller(AT)lhsystems.com), Oct 31 2004` `If Y is a 3-subset of an (2n+1)-set X then, for n>=1, a(n-1) is the number of (2n-1)-subsets of X having at least two elements in common with Y. - Milan R. Janjic (agnus(AT)blic.net), Dec 16 2007`
	LINKS	`T. Mansour, Restricted permutations by patterns of type 2-1.`
	CROSSREFS	`Cf. A100036, A100037, A100038, A100039.` `Sequence in context: A103571 A103572 A049532 this_sequence A000566 A133673 A023166` `Adjacent sequences: A033534 A033535 A033536 this_sequence A033538 A033539 A033540`
	KEYWORD	`nonn`
	AUTHOR	`njas`

page 1

Search completed in 0.002 seconds

Last modified July 26 23:19 EDT 2008. Contains 142293 sequences.

AT&T Labs Research