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 A000094 M1350 N0518 #84 Mar 28 2022 07:46:30
%S A000094 0,0,0,0,1,2,5,8,14,21,32,45,65,88,121,161,215,280,367,471,607,771,
%T A000094 980,1232,1551,1933,2410,2983,3690,4536,5574,6811,8317,10110,12276,
%U A000094 14848,17941,21600,25977,31146,37298,44542,53132,63218,75131,89089
%N A000094 Number of trees of diameter 4.
%C A000094 Number of partitions of n-1 with at least two parts of size 2 or larger. - _Franklin T. Adams-Watters_, Jan 13 2006
%C A000094 Also equal to the number of partitions p of n-1 such that max(p)-min(p) > 1. Example: a(7)=5 because we have [5,1],[4,2],[4,1,1],[3,2,1] and [3,1,1,1]. - _Giovanni Resta_, Feb 06 2006
%C A000094 Also number of partitions of n-1 with at least two parts that are smaller than the largest part. Example: a(7)=5 because we have [4,1,1],[3,2,1],[3,1,1,1],[2,2,1,1,1] and [2,1,1,1,1]. - _Emeric Deutsch_, May 01 2006
%C A000094 Also number of regions of n-1 that do not contain 1 as a part, n >= 2 (cf. A186114, A206437). - _Omar E. Pol_, Dec 01 2011
%C A000094 Also rank of the last region of n-1 multiplied by -1, n >= 2 (cf. A194447). - _Omar E. Pol_, Feb 11 2012
%C A000094 Also sum of ranks of the regions of n-1 that contain emergent parts, n >= 2 (cf. A182699). For the definition of "regions of n" see A206437. - _Omar E. Pol_, Feb 21 2012
%D A000094 N. J. A. Sloane, A Handbook of Integer Sequences, Academic Press, 1973 (includes this sequence).
%D A000094 N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
%H A000094 Christian G. Bower, <a href="/A000094/b000094.txt">Table of n, a(n) for n = 1..500</a>
%H A000094 J. Riordan, <a href="http://dx.doi.org/10.1147/rd.45.0473">Enumeration of trees by height and diameter</a>, IBM J. Res. Dev. 4 (1960), 473-478.
%H A000094 J. Riordan, <a href="/A007401/a007401_8.pdf">The enumeration of trees by height and diameter</a>, IBM Journal 4 (1960), 473-478. (Annotated scanned copy)
%H A000094 Miloslav Znojil, <a href="https://arxiv.org/abs/2008.00479">Perturbation theory near degenerate exceptional points</a>, arXiv:2008.00479 [math-ph], 2020.
%H A000094 <a href="/index/Tra#trees">Index entries for sequences related to trees</a>
%F A000094 a(n+1) = A000041(n)-n for n>0. - _John W. Layman_
%F A000094 G.f.: x/product(1-x^j,j=1..infinity)-x-x^2/(1-x)^2. - _Emeric Deutsch_, May 01 2006
%F A000094 G.f.: sum(sum(x^(i+j+1)/product(1-x^k, k=i..j), i=1..j-2), j=3..infinity). - _Emeric Deutsch_, May 01 2006
%F A000094 a(n+1) = Sum_{m=1..n} A083751(m). - _Gregory Gerard Wojnar_, Oct 13 2020
%e A000094 From _Gus Wiseman_, Apr 12 2019: (Start)
%e A000094 The a(5) = 1 through a(9) = 14 partitions of n-1 with at least two parts of size 2 or larger, or non-hooks, are the following. The Heinz numbers of these partitions are given by A105441.
%e A000094 (22) (32) (33) (43) (44)
%e A000094 (221) (42) (52) (53)
%e A000094 (222) (322) (62)
%e A000094 (321) (331) (332)
%e A000094 (2211) (421) (422)
%e A000094 (2221) (431)
%e A000094 (3211) (521)
%e A000094 (22111) (2222)
%e A000094 (3221)
%e A000094 (3311)
%e A000094 (4211)
%e A000094 (22211)
%e A000094 (32111)
%e A000094 (221111)
%e A000094 The a(5) = 1 through a(9) = 14 partitions of n-1 whose maximum part minus minimum part is at least 2 are the following. The Heinz numbers of these partitions are given by A307516.
%e A000094 (31) (41) (42) (52) (53)
%e A000094 (311) (51) (61) (62)
%e A000094 (321) (331) (71)
%e A000094 (411) (421) (422)
%e A000094 (3111) (511) (431)
%e A000094 (3211) (521)
%e A000094 (4111) (611)
%e A000094 (31111) (3221)
%e A000094 (3311)
%e A000094 (4211)
%e A000094 (5111)
%e A000094 (32111)
%e A000094 (41111)
%e A000094 (311111)
%e A000094 The a(5) = 1 through a(9) = 14 partitions of n-1 with at least two parts that are smaller than the largest part are the following. The Heinz numbers of these partitions are given by A307517.
%e A000094 (211) (311) (321) (322) (422)
%e A000094 (2111) (411) (421) (431)
%e A000094 (2211) (511) (521)
%e A000094 (3111) (3211) (611)
%e A000094 (21111) (4111) (3221)
%e A000094 (22111) (3311)
%e A000094 (31111) (4211)
%e A000094 (211111) (5111)
%e A000094 (22211)
%e A000094 (32111)
%e A000094 (41111)
%e A000094 (221111)
%e A000094 (311111)
%e A000094 (2111111)
%e A000094 (End)
%p A000094 g:=x/product(1-x^j,j=1..70)-x-x^2/(1-x)^2: gser:=series(g,x=0,48): seq(coeff(gser,x,n),n=1..46); # _Emeric Deutsch_, May 01 2006
%p A000094 A000094 := proc(n)
%p A000094 combinat[numbpart](n-1)-n+1 ;
%p A000094 end proc: # _R. J. Mathar_, May 17 2016
%t A000094 t=Table[PartitionsP[n]-n,{n,0,45}];
%t A000094 ReplacePart[t,0,1]
%t A000094 (* _Clark Kimberling_, Mar 05 2012 *)
%t A000094 CoefficientList[1/QPochhammer[x]-x/(1-x)^2-1+O[x]^50, x] (* _Jean-François Alcover_, Feb 04 2016 *)
%Y A000094 Cf. A000041, A206437, A034853, A000147 (diameter 5).
%Y A000094 Cf. A006918, A083751, A084835, A105441, A115720, A257990, A307516, A307517, A325164.
%K A000094 nonn
%O A000094 1,6
%A A000094 _N. J. A. Sloane_
%E A000094 More terms from _Franklin T. Adams-Watters_, Jan 13 2006