This site is supported by donations to The OEIS Foundation.



Please make a donation to keep the OEIS running. We are now in our 55th year. In the past year we added 12000 new sequences and reached 8000 citations (which often say "discovered thanks to the OEIS"). We need to raise money to hire someone to manage submissions, which would reduce the load on our editors and speed up editing.
Other ways to donate

(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A298433 a(n) is the number of tight n X n pavings (defined in A285357). 1
1, 4, 64, 2072, 106738, 7743880, 735490024, 87138728592 (list; graph; refs; listen; history; text; internal format)



Table of n, a(n) for n=1..8.

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.


Cf. A000295, A285357, A285361, A298362.

Sequence in context: A181398 A326274 A081559 * A261042 A002454 A013043

Adjacent sequences:  A298430 A298431 A298432 * A298434 A298435 A298436




Peter Luschny, Jan 19 2018


a(6) from Hugo Pfoertner, Jan 19 2018

a(7) from Denis Roegel, Feb 23 2018

a(8) from Denis Roegel, Feb 24 2018



Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified December 15 04:23 EST 2019. Contains 329991 sequences. (Running on oeis4.)