A298433 a(n) is the number of tight n X n pavings (defined in A285357).
1, 4, 64, 2072, 106738, 7743880, 735490024, 87138728592
Offset: 1
Links
- D. E. Knuth (Proposer), Tight m-by-n pavings; Problem 12005, Amer. Math. Monthly 124 (No. 8, Oct. 2017), page 755.
- D. E. Knuth, A conjecture that had to be true, Stanford Lecture: Don Knuth's Christmas Tree Lecture 2017.
Formula
a(n) = A285357(n,n).
Extensions
a(6) from Hugo Pfoertner, Jan 19 2018
a(7) from Denis Roegel, Feb 23 2018
a(8) from Denis Roegel, Feb 24 2018