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 A056096 #10 May 10 2020 04:28:41 %S A056096 1,4,17,80,403,2128,11628,65208,373175,2170740,12797265,76292736, %T A056096 459162452,2786017120,17024247304,104673837384,647113502847, %U A056096 4020062732140 %N A056096 Maximum value in the distribution by first value of Prufer code of noncrossing spanning trees on a circle of n+2 points; perhaps the number whose Prufer code starts with 2. %C A056096 Total in distribution is # t_n of ternary trees and one can prove first and last values in each distribution is t_{n-1}. Maximum appears to occur at 2, minimum near end; perhaps monotone between first, max, min, last. Distributions of Prufer code initial values, starting with 3 points: [1,1,1], [3,4,2,3], [12,17,9,5,12], [55,80,44,22,17,55], [273,403,227,112,68,72,273],[1428,2128,1218,603,335,267,345,1428]. %C A056096 First 200 values (n=3 to 202) of max occur at k=2; first 200 values of min (series A056098) occur at k=floor((n+5)/2). %F A056096 G.f.: seems to be (g+1)/(1-g)^3 where g*(1-g)^2 = x. - _Mark van Hoeij_, Nov 10 2011 %e A056096 There are 12 noncrossing spanning trees on a circle of 4 points. The first values of their Prufer codes have distribution [3,4,2,3], e.g. 3 start with 1, 4 with 2 and so on. The maximum is a(4) = 4. %Y A056096 Cf. A056098. %K A056096 nonn,more %O A056096 3,2 %A A056096 David S. Hough (hough(AT)gwu.edu), Aug 04 2000