Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A130078
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A130078 Largest 2^x dividing A001623(n), the number of reduced three-line Latin rectangles. +0
3
1, 4, 2, 8, 16, 64, 32, 64, 128, 512, 256, 2048, 8192, 16384, 4096, 65536, 32768, 131072, 65536, 262144, 524288, 2097152, 1048576, 2097152, 4194304, 16777216, 8388608, 134217728, 134217728, 1073741824, 134217728, 536870912, 2147483648 (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, A130077, A130079.

Adjacent sequences: A130075 A130076 A130077 this_sequence A130079 A130080 A130081

Sequence in context: A051239 A002291 A110622 this_sequence A040174 A084477 A046589

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 October 7 14:39 EDT 2008. Contains 144666 sequences.


AT&T Labs Research