This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A298433 #19 Mar 18 2023 14:50:18 %S A298433 1,4,64,2072,106738,7743880,735490024,87138728592 %N A298433 a(n) is the number of tight n X n pavings (defined in A285357). %H A298433 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 A298433 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 A298433 a(n) = A285357(n,n). %Y A298433 Cf. A000295, A285357, A285361, A298362. %K A298433 nonn,more %O A298433 1,2 %A A298433 _Peter Luschny_, Jan 19 2018 %E A298433 a(6) from _Hugo Pfoertner_, Jan 19 2018 %E A298433 a(7) from _Denis Roegel_, Feb 23 2018 %E A298433 a(8) from _Denis Roegel_, Feb 24 2018