OFFSET
1,2
COMMENTS
Observations: (for n+m <= 32)
Examination of values modulus a small prime yields several patterns.
T(n,m) == (n+1)*(m+1) (mod 2) for n+m>2.
T(n,m) == T(n,m+6) (mod 3).
T(n,m) is not divisible by 3.
T(n,m) == 0 (mod 5) for n==4 (mod 5) and m<>2 and except when m=n=4.
T(5,m) == 0 (mod 208) for m >= 13.
T(6,m) == 0 (mod 19) for m >= 19.
LINKS
Andrew Howroyd, Table of n, a(n) for n = 1..496
Eric Weisstein's World of Mathematics, Independent Edge Set
Eric Weisstein's World of Mathematics, Matching
Eric Weisstein's World of Mathematics, Rook Graph
EXAMPLE
The start of the sequence as table:
* 1 2 4 10 26 76 ...
* 2 7 32 193 1382 11719 ...
* 4 32 370 5950 122984 3175696 ...
* 10 193 5950 270529 16873930 1384880065 ...
* 26 1382 122984 168739305 3337807996 909046586596 ...
* 76 11719 3175696 1384880065 909046586596 855404716021831 ...
* ...
CROSSREFS
KEYWORD
nonn,tabl
AUTHOR
Andrew Howroyd, Mar 13 2016
STATUS
approved