id:A130079 - OEIS Search Results

Search: id:A130079

Displaying 1-1 of 1 results found.

page 1

n - A130077(n), i.e. n minus the largest x such that 2^x divides A001623(n), the number of reduced three-line Latin rectangles.

+0
3

3, 2, 4, 3, 3, 2, 4, 4, 4, 3, 5, 3, 2, 2, 5, 2, 4, 3, 5, 4, 4, 3, 5, 5, 5, 4, 6, 3, 4, 2, 6, 5, 4, 3, 5, 4, 4, 3, 5, 5, 5, 4, 6, 4, 3, 3, 6, 0, 5, 4, 6, 5, 5, 4, 6, 6, 6, 5, 7, 3, 5, 2, 7, 6, 4, 3, 5, 4, 4, 3, 5, 5, 5, 4, 6, 4, 1, 3, 6, 4, 5, 4, 6, 5, 5, 4, 6, 6, 6, 5, 7, 4, 5, 3, 7, 6, 5, 4 (list; graph; listen)

	OFFSET	`3,1`
	REFERENCES	`John Riordan, A recurrence relation for three-line Latin rectangles, Amer. Math. Monthly, 59 (1952), pp. 159-162.`
	CROSSREFS	`Cf. A001623, A130077, A130078.` `Sequence in context: A104566 A101403 A025509 this_sequence A134559 A007456 A119707` `Adjacent sequences: A130076 A130077 A130078 this_sequence A130080 A130081 A130082`
	KEYWORD	`nonn`
	AUTHOR	`Douglas Stones (dssto1(AT)student.monash.edu.au), May 06 2007`

page 1

Search completed in 0.002 seconds

Last modified August 19 23:53 EDT 2008. Contains 142930 sequences.

AT&T Labs Research