Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A130077
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A130077 Largest x such that 2^x divides A001623(n), the number of reduced three-line Latin rectangles. +0
3
0, 2, 1, 3, 4, 6, 5, 6, 7, 9, 8, 11, 13, 14, 12, 16, 15, 17, 16, 18, 19, 21, 20, 21, 22, 24, 23, 27, 27, 30, 27, 29, 31, 33, 32, 34, 35, 37, 36, 37, 38, 40, 39, 42, 44, 45, 43, 50, 46, 48, 47, 49, 50, 52, 51, 52, 53, 55, 54, 59, 58, 62, 58, 60, 63, 65, 64, 66, 67, 69, 68, 69, 70 (list; graph; listen)
OFFSET

3,2

REFERENCES

John Riordan, A recurrence relation for three-line Latin rectangles, Amer. Math. Monthly, 59 (1952), pp. 159-162.

CROSSREFS

Cf. A001623, A130078, A130079.

Sequence in context: A075379 A122512 A122514 this_sequence A080412 A098164 A060214

Adjacent sequences: A130074 A130075 A130076 this_sequence A130078 A130079 A130080

KEYWORD

nonn

AUTHOR

Douglas Stones (dssto1(AT)student.monash.edu.au), May 06 2007

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified August 29 17:54 EDT 2008. Contains 143238 sequences.


AT&T Labs Research