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 A273656 #6 May 27 2016 12:23:24
%S A273656 203,4718,66808,750120,7370580,66562188,568136184,4663350120,
%T A273656 37228965774,291297376370,2245876801168,17126594554160,
%U A273656 129527848747752,973416393927768,7278979868039760,54211596845506800,402386221073227314,2977842560384800878,21977111826224423176
%N A273656 Number of forests of labeled rooted trees of height at most 1, with n labels, six of which are used for root nodes and any root may contain >= 1 labels.
%H A273656 Alois P. Heinz, <a href="/A273656/b273656.txt">Table of n, a(n) for n = 6..1000</a>
%F A273656 E.g.f.: x^6/6! * Sum_{j=0..6} Stirling2(6,j)*exp(x)^j.
%F A273656 a(n) = C(n,6) * Sum_{j=0..6} Stirling2(6,j) * j^(n-6).
%p A273656 a:= n-> binomial(n,6)*add(Stirling2(6,j)*j^(n-6), j=0..6):
%p A273656 seq(a(n), n=6..40);
%Y A273656 Column k=6 of A143396.
%K A273656 nonn
%O A273656 6,1
%A A273656 _Alois P. Heinz_, May 27 2016