login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A109042 Table read by antidiagonals: T(n,m) = LCM(n,m) (n >= 0, m >= 0). 11
0, 0, 0, 0, 1, 0, 0, 2, 2, 0, 0, 3, 2, 3, 0, 0, 4, 6, 6, 4, 0, 0, 5, 4, 3, 4, 5, 0, 0, 6, 10, 12, 12, 10, 6, 0, 0, 7, 6, 15, 4, 15, 6, 7, 0, 0, 8, 14, 6, 20, 20, 6, 14, 8, 0, 0, 9, 8, 21, 12, 5, 12, 21, 8, 9, 0, 0, 10, 18, 24, 28, 30, 30, 28, 24, 18, 10, 0, 0, 11, 10, 9, 8, 35, 6, 35, 8, 9 (list; table; graph; refs; listen; history; internal format)
OFFSET

0,8

FORMULA

LCM(n, m) = n*m/GCD(n, m)

CROSSREFS

Rows A000027, A109043, A109044, A109045, A109046, A109047, A109048, A109049, A109050, A109051, A109052, A109053.

A003990 is (1, 1) based.

Sequence in context: A133388 A158092 A145264 * A128540 A160692 A051775

Adjacent sequences:  A109039 A109040 A109041 * A109043 A109044 A109045

KEYWORD

nonn,easy,tabl

AUTHOR

Mitch Harris (Harris.Mitchell(AT)mgh.harvard.edu), Jun 18 2005

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 15 19:15 EST 2012. Contains 205852 sequences.