|
Search: id:A120889
|
|
|
| A120889 |
|
Triangle read by rows: T(n,k)=GCD(k,ceiling(n/k)) (1<=k<=n). |
|
+0
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; listen)
|
|
|
OFFSET
|
1,5
|
|
|
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,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 (deutsch(AT)duke.poly.edu), Jul 26 2006
|
|
CROSSREFS
|
Cf. A120888.
Adjacent sequences: A120886 A120887 A120888 this_sequence A120890 A120891 A120892
Sequence in context: A136673 A097588 A030382 this_sequence A092523 A120891 A034002
|
|
KEYWORD
|
nonn,tabl
|
|
AUTHOR
|
Leroy Quet (qq-quet(AT)mindspring.com), Jul 12 2006
|
|
EXTENSIONS
|
More terms from Emeric Deutsch (deutsch(AT)duke.poly.edu), Jul 26 2006
|
|
|
Search completed in 0.002 seconds
|
