Do you have a favourite integer sequence in the OEIS? If so, what is it?

(boosts appreciated)

This is an x-post from birdsite, where I got no replies (I think I've been shadow banned).

Does anyone know if #Fritzing works with #Catalina?

I swear, I deserve to be shadowbanned on every platform, so it's all good, except when I can't find information I need.

The other day I heard the term "glimmer" for the first time; it's the opposite of a trigger. It's something that brings you to a state of emotional regulation and safety.

Personally, I love this term.

Four pages are indeed necessary for planar graphs: arxiv.org/abs/2004.07630

At STOC 1986, Yannakakis proved that planar graphs have 4-page book embeddings (see en.wikipedia.org/wiki/Book_emb for what this means), announced an example requiring 4 pages, but never published the example. Finally now Bekos et al. have provided detailed constructions for planar graphs requiring 4 pages.

Still lost in limbo: Unger's claim from 1992 that testing 3-page embeddability with fixed vertex ordering is polynomial.

A variant of the classic 15-puzzle, where the puzzle is coiled around a cylinder. Unlike the original, this version is solvable because of the extra connection between the first and sixteenth squares of the frame. YouTube: youtu.be/rfAEgxNEOrQ

A day's break in the strike has allowed us to open-source Coursebuilder, the tool we made to produce accessible web-based versions of lecture notes.
github.com/coursebuilder-ncl/m
It takes in LaTeX, and outputs HTML pages and slideshows.

enjoyed this release:

archive.org/details/lovecraft-
V/A - Lovecraft Creatures (2020)
Cian Orbe Netlabel
2020-02-14
CC BY-NC-ND
lovecraft, horror, dark ambient, experimental, creatures, soundtrack, ninurta, yog-sothoth, chthonian, sub-niggurath, nyarlathotep

I'm not sure I've seen this puzzle before, and I really like it:

We have n keys and n boxes. Each key fits only one box. We shuffle the keys and put one in each box. Then we randomly break open 1≤k≤n boxes. What is the probability that we can unlock all the other boxes?

I've been thinking about the fact that an n×n square grid has as many cells as a triangular lattice with n triangles on each side.
Is there a nice continuous bijection between them? When n is odd, you can at least keep one line of symmetry throughout.

testing MathJax 

Aha, so it doesn't seem to be set up for the `\$$…\$\$` tokens, but does work with `\\(…\\)`. OK then.

Show thread
Mathstodon

The social network of the future: No ads, no corporate surveillance, ethical design, and decentralization! Own your data with Mastodon!