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 A046652 #16 Mar 08 2020 00:23:36
%S A046652 1,2,2,3,8,7,4,21,34,30,5,44,114,160,143,6,80,308,609,806,728,7,132,
%T A046652 715,1908,3315,4256,3876,8,203,1482,5185,11420,18444,23256,21318,9,
%U A046652 296,2814,12600,34520,67856,104652,130416,120175,10,414,4984,27965,93924,221300,404016,603801,746350,690690,11,560,8343,57584,234066,654336,1394505,2418372,3533145,4341480,4032015
%N A046652 Triangle of rooted planar maps, read by rows.
%H A046652 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 A046652 W. G. Brown, <a href="/A000087/a000087.pdf">Enumeration of non-separable planar maps</a> [Annotated scanned copy]
%e A046652 Triangle begins:
%e A046652 1;
%e A046652 2, 2;
%e A046652 3, 8, 7;
%e A046652 4, 21, 34, 30;
%e A046652 5, 44, 114, 160, 143;
%e A046652 6, 80, 308, 609, 806, 728;
%e A046652 ...
%p A046652 T := proc(n, k) if k<=n then k*sum((2*j-k+1)*(j-1)!*(3*n-k-j)!/(j-k+1)!/(j-k)!/(2*k-j-1)!/(n-j)!, j=k..min(n, 2*k-1))/(2*n-k+1)! else 0 fi end: seq(seq(T(n, n-k+1), k=1..n), n=1..11); # Herman Jamke (hermanjamke(AT)fastmail.fm), Mar 30 2008
%t A046652 t[n_, k_] := If[k <= n, k*Sum[(2*j-k+1)*(j-1)!*(3*n-k-j)!/(j-k+1)!/(j-k)!/(2*k-j-1)!/(n-j)!, {j, k, Min[n, 2*k-1]}]/(2*n-k+1)!, 0]; Table[t[n, k], {n, 1, 11}, {k, n, 1, -1}] // Flatten (* _Jean-François Alcover_, Jan 20 2014, after Herman Jamke *)
%Y A046652 A091665 is the same triangle with rows reversed and has much more information.
%K A046652 tabl,nonn,easy
%O A046652 0,2
%A A046652 _N. J. A. Sloane_
%E A046652 More terms from Herman Jamke (hermanjamke(AT)fastmail.fm), Mar 30 2008