|
Search: id:A109004
|
|
|
| A109004 |
|
Table of GCD(n,m) read by antidiagonals, n >= 0, m >= 0. |
|
+0
15
|
|
| 0, 1, 1, 2, 1, 2, 3, 1, 1, 3, 4, 1, 2, 1, 4, 5, 1, 1, 1, 1, 5, 6, 1, 2, 3, 2, 1, 6, 7, 1, 1, 1, 1, 1, 1, 7, 8, 1, 2, 1, 4, 1, 2, 1, 8, 9, 1, 1, 3, 1, 1, 3, 1, 1, 9, 10, 1, 2, 1, 2, 5, 2, 1, 2, 1, 10, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 11, 12, 1, 2, 3, 4, 1, 6, 1, 4, 3, 2, 1, 12, 13, 1, 1, 1, 1, 1, 1, 1
(list; table; graph; listen)
|
|
|
OFFSET
|
0,4
|
|
|
REFERENCES
|
R. L. Graham, D. E. Knuth and O. Patashnik, Concrete Mathematics, Addison-Wesley, 2nd ed., 1994, ch. 4.
D. E. Knuth, The Art of Computer Programming, Addison-Wesley, section 4. 5. 2
|
|
FORMULA
|
a(n, m) = a(m, n) = a(m, n-m) = a(m, n mod m), n >= m.
a(n, m) = n + m - n*m + 2*sum_k=1..m-1 floor(k*n/m).
Multiplicative in both parameters with a(p^e, m) = GCD(p^e, m). David W. Wilson (davidwwilson(AT)comcast.net) Jun 12, 2005.
|
|
CROSSREFS
|
Rows, columns and diagonals: A089128, A109007, A109008, A109009, A109010, A109011, A109012, A109013, A109014, A109015.
A003989 is (1, 1) based.
Sequence in context: A133232 A137152 A159335 this_sequence A103823 A136642 A080382
Adjacent sequences: A109001 A109002 A109003 this_sequence A109005 A109006 A109007
|
|
KEYWORD
|
nonn,easy,mult,tabl
|
|
AUTHOR
|
Mitch Harris (Harris.Mitchell(AT)mgh.harvard.edu)
|
|
|
Search completed in 0.002 seconds
|
