|
Search: id:A120888
|
|
|
| A120888 |
|
Triangle read by rows: T(n,k)=GCD(k,floor(n/k)) (1<=k<=n). |
|
+0
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, 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
(list; table; graph; listen)
|
|
|
OFFSET
|
1,8
|
|
|
LINKS
|
Leroy Quet, Home Page (listed in lieu of email address)
|
|
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 (deutsch(AT)duke.poly.edu), Jul 24 2006
|
|
CROSSREFS
|
Cf. A120889.
Sequence in context: A105242 A114116 A054532 this_sequence A031230 A111616 A113120
Adjacent sequences: A120885 A120886 A120887 this_sequence A120889 A120890 A120891
|
|
KEYWORD
|
nonn,tabl
|
|
AUTHOR
|
Leroy Quet, Jul 12 2006
|
|
EXTENSIONS
|
More terms from Emeric Deutsch (deutsch(AT)duke.poly.edu), Jul 24 2006
|
|
|
Search completed in 0.002 seconds
|
