Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A136527
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A136527 Triangle read by rows: T(n,k) = greatest common divisor of n-th and k-th composite number, 1<=k<=n. +0
3
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; listen)
OFFSET

1,1

COMMENT

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: A097467 A092205 A059853 this_sequence A138614 A161912 A162339

Adjacent sequences: A136524 A136525 A136526 this_sequence A136528 A136529 A136530

KEYWORD

nonn,tabl

AUTHOR

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

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 December 7 08:40 EST 2009. Contains 170430 sequences.


AT&T Labs Research