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 A225497 #7 May 09 2013 12:36:27
%S A225497 1,6,42,380,4320,59682,974848,18423288,396000000,9548713790,
%T A225497 255409127424,7507985556084,240659872940032,8355664160156250,
%U A225497 312437224148828160,12519386633593104368,535233488907211702272,24320165501859426874998,1170472960000000000000000,59483046140261749951587180
%N A225497 Total number of rooted labeled trees over all forests on {1,2,...,n} in which one tree has been specially designated.
%C A225497 The expected number of trees in each forest approaches 5/2 as n gets large.
%F A225497 a(n) = Sum_{k=1..n} binomial(n,k)*n^(n-k)*k^2 = ((1 + 1/n)^n n^(1 + n) (-1 + 5 n))/(1 + n)^3.
%F A225497 a(n) = Sum_{k=1..n} A225465(n,k)*k.
%e A225497 a(2) = 6 because there are 6 trees in these forests on 2 nodes. The root node is on top and the designated tree is marked by '.
%e A225497 ...1'... ...2'... ...1'..2... ...1..2'...
%e A225497 ...| ... ...| ... ........... ...........
%e A225497 ...2 ... ...1 ... ........... ...........
%t A225497 Table[Sum[Binomial[n - 1, k - 1] n^(n - k) k^2, {k, 1, n}], {n, 1,
%t A225497 20}]
%K A225497 nonn
%O A225497 1,2
%A A225497 _Geoffrey Critzer_, May 08 2013