|
|
A120889
|
|
Triangle read by rows: T(n,k) = gcd(k,ceiling(n/k)) (1 <= k <= n).
|
|
2
|
|
|
1, 1, 1, 1, 2, 1, 1, 2, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 2, 1, 1, 1, 2, 3, 2, 1, 2, 1, 1, 2, 3, 2, 1, 2, 1, 1, 1, 1, 3, 1, 1, 2, 1, 2, 1, 1, 1, 1, 1, 1, 2, 1, 2, 1, 1, 1, 2, 1, 1, 1, 2, 1, 2, 1, 2, 1, 1, 2, 1, 1, 1, 2, 1, 2, 1, 2, 1, 1, 1, 1, 1, 4, 1, 3, 1, 2, 1, 2, 1, 2, 1, 1, 1, 1, 4, 1, 3, 1, 2, 1, 2, 1, 2, 1, 1
(list;
table;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,5
|
|
LINKS
|
|
|
EXAMPLE
|
Triangle starts:
1;
1, 1;
1, 2, 1;
1, 2, 1, 1;
1, 1, 1, 2, 1;
1, 1, 1, 2, 1, 1;
1, 2, 3, 2, 1, 2, 1;
...
|
|
MAPLE
|
T:=proc(n, k) if k<=n then gcd(k, ceil(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 26 2006
|
|
MATHEMATICA
|
T[n_, k_] := GCD[k, Ceiling[n/k]];
|
|
CROSSREFS
|
|
|
KEYWORD
|
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|