|
Search: id:A114999
|
|
|
| A114999 |
|
Array read by antidiagonals: T(m,n) = Sum_{i=1..m, j=1..n, gcd(i,j)=1} (m+1-i)*(n+1-j), m>=1, n>=1. |
|
+0
4
|
|
| 1, 3, 3, 6, 8, 6, 10, 16, 16, 10, 15, 26, 31, 26, 15, 21, 39, 50, 50, 39, 21, 28, 54, 75, 80, 75, 54, 28, 36, 72, 103, 120, 120, 103, 72, 36, 45, 92, 137, 164, 179, 164, 137, 92, 45, 55, 115, 175, 218, 244, 244, 218, 175, 115, 55, 66, 140, 218, 278, 324, 332, 324, 278, 218, 140
(list; table; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
LINKS
|
Max Alekseyev, On the number of two-dimensional threshold functions
|
|
MAPLE
|
T:=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;
|
|
CROSSREFS
|
Cf. A114043, A115004, A115005, A115006, A115007.
Sequence in context: A078477 A098832 A107985 this_sequence A021752 A049626 A130780
Adjacent sequences: A114996 A114997 A114998 this_sequence A115000 A115001 A115002
|
|
KEYWORD
|
nonn,tabl
|
|
AUTHOR
|
njas, Feb 23 2006
|
|
|
Search completed in 0.002 seconds
|
