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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A136527 Triangle read by rows: T(n,k) = greatest common divisor of n-th and k-th composite number, 1<=k<=n. 2
4, 2, 6, 4, 2, 8, 1, 3, 1, 9, 2, 2, 2, 1, 10, 4, 6, 4, 3, 2, 12, 2, 2, 2, 1, 2, 2, 14, 1, 3, 1, 3, 5, 3, 1, 15, 4, 2, 8, 1, 2, 4, 2, 1, 16, 2, 6, 2, 9, 2, 6, 2, 3, 2, 18, 4, 2, 4, 1, 10, 4, 2, 5, 4, 2, 20, 1, 3, 1, 3, 1, 3, 7, 3, 1, 3, 1, 21, 2, 2, 2, 1, 2, 2, 2, 1, 2, 2, 2, 1, 22, 4, 6, 8, 3, 2, 12, 2, 3, 8, 6 (list; table; graph; refs; listen; history; internal format)
OFFSET

1,1

COMMENTS

T(n,k) = A050873(A002808(n),A002808(k));

A073783(n) = T(n-1,n) for n>1;

A002808(n) = T(n,n).

CROSSREFS

Sequence in context: A187109 A092205 A059853 * A138614 A161912 A162339

Adjacent sequences:  A136524 A136525 A136526 * A136528 A136529 A136530

KEYWORD

nonn,tabl

AUTHOR

Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Jan 03 2008

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 14 04:10 EST 2012. Contains 205570 sequences.