This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A120889 Triangle read by rows: T(n,k)=GCD(k,ceiling(n/k)) (1<=k<=n). 1
 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,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 CROSSREFS Cf. A120888. Sequence in context: A183014 A030382 A192004 * A092523 A120891 A034002 Adjacent sequences:  A120886 A120887 A120888 * A120890 A120891 A120892 KEYWORD nonn,tabl AUTHOR Leroy Quet, Jul 12 2006 EXTENSIONS More terms from Emeric Deutsch, Jul 26 2006 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .