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 A046653 #20 Jan 13 2025 15:06:40 %S A046653 1,1,1,1,1,2,1,2,3,4,1,2,8,12,14,1,3,12,30,43,49,1,3,22,63,134,189, %T A046653 216,1,4,31,133,323,608,888,984,1,4,48,238,759,1671,2988,4332,4862,1, %U A046653 5,64,422,1594,4260,8772,15126,22011,24739,1,5,90,694,3210,10002,23986,46923,79214,115131,130338,1,6,115,1106,6024,22176,60813,135097,255277,424034,616395,701584 %N A046653 Triangle of rooted planar maps up to orientation-preserving isomorphisms. %H A046653 W. G. Brown, <a href="http://dx.doi.org/10.4153/CJM-1963-056-7">Enumeration of non-separable planar maps</a>, Canad. J. Math., 15 (1963), 526-545. %H A046653 W. G. Brown, <a href="/A000087/a000087.pdf">Enumeration of non-separable planar maps</a> [Annotated scanned copy] %F A046653 Reference gives generating functions. %e A046653 Triangle begins: %e A046653 1; %e A046653 1, 1; %e A046653 1, 1, 2; %e A046653 1, 2, 3, 4; %e A046653 1, 2, 8, 12, 14; %e A046653 1, 3, 12, 30, 43, 49; %e A046653 ... %p A046653 # uses function L(.,.) from A046650 %p A046653 for n from 2 to 13 do %p A046653 for m from n to 2 by -1 do %p A046653 printf("%d,",L(n,m)) ; %p A046653 end do: %p A046653 printf("\n") ; %p A046653 end do: # _R. J. Mathar_, Apr 13 2019 %Y A046653 Cf. A046650 (diagonal), A000087 (row sums). %K A046653 tabl,nonn,easy %O A046653 2,6 %A A046653 _N. J. A. Sloane_ %E A046653 More terms from _R. J. Mathar_, Apr 13 2019