HN Theater @HNTheaterMonth

The best description of the OEIS I've heard is by Donald Knuth in this fun talk (https://youtu.be/BxQw4CdxLr8) where at 19:50 he says how it lets you "compute your way into the literature":

> For the last 30 years or more, there has been a wonderful tool for all kinds of problems of this form and it's been online for a long time: we have the Online Encyclopedia of Integer Sequences. And this is just the nicest thing since sliced bread for mathematics because you can compute your way into the literature. [audience laughter] If you want to know if anybody else has ever studied a problem, all you have to do is evaluate the first few cases of it and then you look it up and there it is. The hit rate is incredible, and all kinds of mathematicians have discovered each other through the OEIS. […] I donate to Wikipedia and the Internet Archive and the OEIS.

(Aside: A good blog post about that lecture: https://thenewstack.io/donald-knuths-christmas-tree-lecture-...)

Indeed I've used it this way many times; the most recent example is that I became curious about how many polynomial functions there are mod n (after posting this comment: https://news.ycombinator.com/item?id=26482028), and by computing the answers for n up to 10, I was able to look up up those numbers in the OEIS and find the general formula, and also the relevant papers. (Asked a question about it here: https://math.stackexchange.com/questions/4070051/how-many-di... but ended up answering it myself…) I don't think I'd have even known where to look (as I'm not a professional mathematician), if not for the OEIS. And this happens again and again.

⬐ bjoli

I have answered more than a few "what does this code do?" by just doing that.

Feed the code some numbers, look for the output in oeis and bam! Instant guru status.

⬐ sn9

What were the contexts in which you needed to examine a sequence of numbers transformed through a bit of code?

I'm assuming it's something more niche than CRUD development.

(I'm just curious, but would understand if it's something you can't talk about.)

⬐ bjoli

It is less exciting than you think. I am not a programmer by profession.

One example is here: https://www.reddit.com/r/scheme/comments/k3b3hg/need_a_littl...

I have other more recent (and better) examples, but most are in closed forums or IRC l.

Don Knuth's 2017 Christmas lecture featured a way to count how many ways a rectangle can be subdivided into rectangles [0]. It got its own entry in the Online Encyclopedia of Integer Sequences [1].

[0] https://youtu.be/BxQw4CdxLr8 [1] https://oeis.org/A285357

His first publication, as a high-school student, was in MAD magazine. His books are full of jokes, both highly technical ones and more trivial ones. :-)

If you have some mathematical inclination and a couple of hours to spare, you may like watching his (1-hour) Christmas lecture from 2017: https://www.youtube.com/watch?v=BxQw4CdxLr8 — you may need to listen carefully (he's over 80 after all), but some of his humour comes through at moments.

> unfortunately he's unable to present it well. His lectures are almost useless.

I don't know; I've listened to dozens of hours of his videos and found them all useful and rather clear. I've heard comments like yours from others though, and I guess there are two points:

* Of course a person at 80 will not speak the same way they did at 40. (I'm currently watching his lectures on Mathematical Writing, given when he was 49: https://www.youtube.com/watch?v=mert0kmZvVM&index=2&t=0s&lis... -- youtube has some even older videos on TeX etc but they're probably of less general interest.) Older people generally have more halting speech and the like, but this is perfectly natural. I suspect that if, for cultural or whatever reasons, you haven't spent a lot of time listening to old people and learning from them, you may just find it unfamiliar. Nevertheless, I was in the audience when Knuth gave his 2017 Christmas Lecture weeks before his 80th birthday, and a lot of the audience did seem to follow along and enjoyed it. (You can hear laughter in the expected places in the video: https://www.youtube.com/watch?v=BxQw4CdxLr8 -- so clearly not everyone feels the way you do.)

* Every person has their own speech style, their way of translating thought into sounds. Like an unfamiliar accent, it may take a few minutes or hours to get used to it. (If you care enough about the content you will.) What you get from speech idiosyncrasies (their pauses, backtracking, mistakes, etc.) that you don't get from the written word is a window into someone's way of thinking, and I find in Knuth's lectures it's much easier to follow along his thought process, than in speakers you may consider more "smooth". It's very natural and informal, even when he's discussing highly technical topics there's a lot of him that comes through, and that's very valuable IMO.

(And his speech seems well within the norm... I've seen comments like yours that sometimes attempt to diagnose medical conditions from afar; that can seem a bit excessive.)

Ah one place I ran across this: see 16:05 of Knuth's 2017 Christmas lecture (https://www.youtube.com/watch?v=BxQw4CdxLr8):

> I got a nice piece of paper here to work with. They had a conference in Poland last year [BachoTeX 2016] and they sent me this nice pad of paper and I like it so much that I decided at my birthday party next month I gotta give out notepaper that's... [audio drowned by laughter] But actually the notepaper at my birthday party is going to be triangle... paper. Because I have a feeling that all kinds of mathematics has never been invented yet because people haven't been given triangle... [laughter].

This works well for me too :) Specifically when I am going to sleep. Recently, I spent a couple of days working on "tight paving/tiles" problem from Knuth's Christmas Lecture ( https://www.youtube.com/watch?v=BxQw4CdxLr8 ) and surprised myself when I managed to exhaustively enumerate all valid arrangements(around 40 I think) for some small configuration while lying on the bed at night, something that I never thought I could do without a pen and paper.

I found Knuth’s “Dancing Links” paper [1] very well written and a somewhat easy read (I had to reread certain parts a couple times). I had to write a sudoku solver for one of my classes and I read that dancing links and algorithm x was one way to do it [2]. I then read some things around the internet to apply dancing links to sudoku solving [3] [4]. If you read the Wikipedia entry on exact cover problems there is a section on sudoku as an exact cover problem [5] this is one thing necessary to understand in order to implement a sudoku solver with algorithm x and dancing links.

Knuth even talks about dancing links in his new 2017 Christmas Tree Lecture [6] specifically here at 4:28 [7]. Basically he uses dancing links to solve for certain n in the problem he sets up in that lecture.

[1] https://arxiv.org/abs/cs/0011047

[2] https://en.wikipedia.org/wiki/Sudoku_solving_algorithms#Exac...

[3] http://garethrees.org/2007/06/10/zendoku-generation/

[4] https://www.ocf.berkeley.edu/~jchu/publicportal/sudoku/sudok...

[5] https://en.wikipedia.org/wiki/Exact_cover#Sudoku

[6] https://www.youtube.com/watch?v=BxQw4CdxLr8

[7] https://youtu.be/BxQw4CdxLr8?t=4m28s

⬐ mcguire

Knuth is, almost universally, a joy to read.

⬐ svat

You may like to know that Knuth's fascicle 5C of The Art of Computer Programming Volume 4 is going to be entirely about Dancing Links. He's still working on it, but the “incomplete draft” is available at the (hidden) link https://cs.stanford.edu/~knuth/fasc5c.ps.gz — check it out if you're interested; it's already 130 pages of fun.

⬐ johnsonjo

I think he mentioned that it would be in his new book, but I had no idea there would be over 100 pages of dancing links. That is sweet! I’d love to take a look at it, so I could get a better grasp of how it applies to other problems.

⬐ johnsonjo

Wow, this really is good I started it and skimmed the rest of it the first 34 pages are explanations and algorithms of dancing links and the rest of the 130 pages is all exercises and answers to those exercises. Truly awesome, thanks again for the link.

Indeed! He mentions something related at 5:00 in the video (https://youtu.be/BxQw4CdxLr8?t=300):

> You know, people think that mathematicians have been working for hundreds of years and now there's tens of thousands or hundreds of thousands of mathematicians all spending every day working on problems so how could you possibly still find a simple down-to-earth problem that hasn't already been studied, you know, way too much? And the answer is: those problems aren't rare at all, they keep coming up several times a year, and this is an example where even this very basic problem of rectangle into rectangles has all kinds of, sort of, stones not yet turned.

And the other thing you mentioned is one of the reasons it's always a pleasure for me to see Knuth's talks or read his work — he is one of the mathematicians (like Euler and unlike Gauss) who make it seem simple: we get the impression that we could do it too, if we spent enough time on it, that things are within reach for us, just barely. This is so inspiring. And then of course when you step back and look at his body of work, it's staggering! (Something like this talk may account for about half a page of Knuth's published output, and he has thousands of them…) That's additionally inspiring.

⬐ svat

I attended this yesterday. Knuth started with a problem about rectangles inside rectangles (https://imgur.com/faWRt2q — it's going to be an exercise in 7.2.2.1 of TAOCP when that's published, currently in the draft version of Pre-Fascicle 5C). He worked through some small cases, made a conjecture, showed a problem submitted to the Monthly, and lots of cool stuff with generating functions. The lecture was also peppered with jokes and cool stories, including a fascinating conjecture by Bill Gosper, who has a long history of coming up with these Ramanujan-like identities. He also showed a wonderful conjecture (involving queens on an infinite chessboard) that he thinks may never be proved, and showed a snippet of his CWEB program for the problem.

Knuth is turning 80 in about a month, and his talks seem to get better every year. (Though last year's lecture on Hamiltonian Paths in Antiquity, which among other things covers Sanskrit poems that satisfy a “knight's tour” constraint, holds a special place in my heart — been planning to elaborate on it.)