A120888 Triangle read by rows: T(n,k) = gcd(k,floor(n/k)) (1 <= k <= n).

1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 2, 1, 1, 1, 1, 1, 2, 3, 2, 1, 1, 1, 1, 1, 1, 1, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1

Offset

1,8

Links

Table of n, a(n) for n=1..105.

Example

Triangle starts:
  1;
  1, 1;
  1, 1, 1;
  1, 2, 1, 1;
  1, 2, 1, 1, 1;
  1, 1, 1, 1, 1, 1;
  1, 1, 1, 1, 1, 1, 1;
  1, 2, 1, 2, 1, 1, 1, 1;

Maple

T:=proc(n, k) if k<=n then gcd(k, floor(n/k)) else 0 fi end: for n from 1 to 16 do seq(T(n, k), k=1..n) od; # yields sequence in triangular form - Emeric Deutsch, Jul 24 2006

Crossrefs

Cf. A120889.

Sequence in context: A260415 A370942 A214710 * A031230 A355032 A244226

Adjacent sequences: A120885 A120886 A120887 * A120889 A120890 A120891

Keyword

nonn,tabl

Author

Leroy Quet, Jul 12 2006

Extensions

More terms from Emeric Deutsch, Jul 24 2006

Status

approved