|
Search: id:A115009
|
|
|
| A115009 |
|
Array read by antidiagonals: let V(m,n) = Sum_{i=1..m, j=1..n, gcd(i,j)=1} (m+1-i)*(n+1-j), then T(m,n) = 2*m*n+m+n+2*V(m,n), for m >= 0, n >= 0. |
|
+0
2
|
|
| 0, 1, 1, 2, 6, 2, 3, 13, 13, 3, 4, 22, 28, 22, 4, 5, 33, 49, 49, 33, 5, 6, 46, 74, 86, 74, 46, 6, 7, 61, 105, 131, 131, 105, 61, 7, 8, 78, 140, 188, 200, 188, 140, 78, 8, 9, 97, 181, 251, 289, 289, 251, 181, 97, 9, 10, 118, 226, 326, 386, 418, 386, 326, 226, 118, 10, 11, 141, 277
(list; table; graph; listen)
|
|
|
OFFSET
|
0,4
|
|
|
LINKS
|
Max Alekseyev, On the number of two-dimensional threshold functions
|
|
MAPLE
|
V:=proc(m, n) local t1, i, j; t1:=0; for i from 1 to m do for j from 1 to n do if gcd(i, j)=1 then t1:=t1+(m+1-i)*(n+1-j); fi; od; od; t1; end; T:=(m, n)->(2*m*n+m+n+2*V(m, n));
|
|
CROSSREFS
|
Cf. A114999, A114043, A115004, A115005, A115006, A115007, A115010, A115011.
Sequence in context: A062539 A110218 A057892 this_sequence A073094 A057606 A021385
Adjacent sequences: A115006 A115007 A115008 this_sequence A115010 A115011 A115012
|
|
KEYWORD
|
nonn,tabl
|
|
AUTHOR
|
njas, Feb 24 2006
|
|
|
Search completed in 0.002 seconds
|
