login
a(n) is the number of tight n X n pavings (defined in A285357).
1

%I #19 Mar 18 2023 14:50:18

%S 1,4,64,2072,106738,7743880,735490024,87138728592

%N a(n) is the number of tight n X n pavings (defined in A285357).

%H D. E. Knuth (Proposer), <a href="http://dx.doi.org/10.4169/amer.math.monthly.124.8.754">Tight m-by-n pavings; Problem 12005</a>, Amer. Math. Monthly 124 (No. 8, Oct. 2017), page 755.

%H D. E. Knuth, <a href="https://www.youtube.com/watch?v=BxQw4CdxLr8">A conjecture that had to be true</a>, Stanford Lecture: Don Knuth's Christmas Tree Lecture 2017.

%F a(n) = A285357(n,n).

%Y Cf. A000295, A285357, A285361, A298362.

%K nonn,more

%O 1,2

%A _Peter Luschny_, Jan 19 2018

%E a(6) from _Hugo Pfoertner_, Jan 19 2018

%E a(7) from _Denis Roegel_, Feb 23 2018

%E a(8) from _Denis Roegel_, Feb 24 2018