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 A287222 #11 Jun 13 2017 09:17:11 %S A287222 0,0,0,0,2,16,164,944,4386,22240,83066,398132 %N A287222 Number of 3-time self-crossing partitions on n nodes. %C A287222 The meandric numbers A005316 are the numbers of paths which cross themselves 0 times. %C A287222 This sequence is the number of paths that must cross themselves exactly 3 times. %H A287222 B. W. J. Irwin, <a href="https://www.authorea.com/users/5445/articles/173040-on-the-number-of-k-crossing-partitions/_show_article">On the number of k-crossing partitions</a> %e A287222 a(4) = 2, this is from the partitions (2,4,1,3) and (3,4,1,2). %Y A287222 Cf. A005316, A287220, A287221. %K A287222 nonn,more %O A287222 0,5 %A A287222 _Benedict W. J. Irwin_, May 22 2017