id:A013927 - OEIS Search Results

Search: id:A013927

Displaying 1-1 of 1 results found.

page 1

Begin with 2n cards in n piles of 2, the piles being {1,1},{2,2},{3,3},...,{n,n}. How many transpositions of adjacent (single) cards are needed to reverse the order of the piles?

+0
1

0, 2, 5, 10, 15, 23 (list; graph; listen)

	OFFSET	`1,2`
	REFERENCES	`Graham Brightwell, Michael Littman and Peter Winkler (pw(AT)research.bell-labs.com), unpublished.`
	CROSSREFS	`Sequence in context: A125622 A080551 A008822 this_sequence A163059 A099738 A117582` `Adjacent sequences: A013924 A013925 A013926 this_sequence A013928 A013929 A013930`
	KEYWORD	`nonn`
	AUTHOR	`N. J. A. Sloane (njas(AT)research.att.com).`

page 1

Search completed in 0.002 seconds

Last modified December 3 22:15 EST 2009. Contains 170310 sequences.

AT&T Labs Research