|
%I #27 Jul 04 2023 12:35:22
%S 1,12,25,49,81,121,169,225,289,361,441,529,625,729,841,961,1089,1225,
%T 1369,1521,1681,1849,2025,2209,2401,2601,2809,3025,3249,3481,3721,
%U 3969,4225,4489,4761,5041,5329,5625,5929,6241,6561,6889,7225,7569,7921,8281,8649,9025,9409,9801,10201
%N Number of 2 X 2 matrices with all elements in {0,..,n} having determinant = n*permanent.
%C Same as A016754, except for n=1. Here a(1)=12 but A016754(1)=9.
%H Indranil Ghosh, <a href="/A280321/b280321.txt">Table of n, a(n) for n = 0..990</a>
%F a(n+1) = (((n-2)*a(n))/(n-1)) + ((12*(n)^2-12*(n)+1)/(n-1)) for n>=1.
%F Conjectures from _Colin Barker_, Jan 01 2017: (Start)
%F a(n) = (1 + 2*n)^2 = A273789(n) = A273743(n) for n>1.
%F a(n) = 3*a(n-1) - 3*a(n-2) + a(n-3) for n>4.
%F G.f.: (1 + 9*x - 8*x^2 + 9*x^3 - 3*x^4) / (1 - x)^3.
%F (End)
%o (Python)
%o def t(n):
%o s=0
%o for a in range(n+1):
%o for b in range(n+1):
%o for c in range(n+1):
%o for d in range(n+1):
%o if (a*d-b*c)==n*(a*d+b*c):
%o s+=1
%o return s
%o for i in range(41):
%o print(str(i)+" "+str(t(i)))
%Y Cf. A016754.
%K nonn
%O 0,2
%A _Indranil Ghosh_, Jan 01 2017
|
