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 A273655 #4 May 27 2016 12:13:20
%S A273655 52,906,9891,87416,686826,5020092,35006202,236460312,1562226237,
%T A273655 10158790642,65294141913,415967090448,2631510433188,16551428673528,
%U A273655 103578621308388,645186720537744,4000912828433199,24700465510596414,151810205132056779,928768921758036744
%N A273655 Number of forests of labeled rooted trees of height at most 1, with n labels, five of which are used for root nodes and any root may contain >= 1 labels.
%H A273655 Alois P. Heinz, <a href="/A273655/b273655.txt">Table of n, a(n) for n = 5..1000</a>
%F A273655 E.g.f.: x^5/5! * Sum_{j=0..5} Stirling2(5,j)*exp(x)^j.
%F A273655 a(n) = C(n,5) * Sum_{j=0..5} Stirling2(5,j) * j^(n-5).
%p A273655 a:= n-> binomial(n,5)*add(Stirling2(5,j)*j^(n-5), j=0..5):
%p A273655 seq(a(n), n=5..40);
%Y A273655 Column k=5 of A143396.
%K A273655 nonn
%O A273655 5,1
%A A273655 _Alois P. Heinz_, May 27 2016