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 A258485 #22 Jul 24 2015 05:23:07
%S A258485 1,1,365,7119961,1172597933594,934741501255380321,
%T A258485 2602204282373953017437500,20410544568790568555722851029455,
%U A258485 387481340785957748099474582410763014214,15899856312608503503306403988460714538830399657
%N A258485 Number of tangled chains of length k=7.
%C A258485 Tangled chains are ordered lists of k rooted binary trees with n leaves and a matching between each leaf from the i-th tree with a unique leaf from the (i+1)-st tree up to isomorphism on the binary trees. This sequence fixes k=6, and n = 1,2,3,...
%D A258485 R. Page, Tangled trees: phylogeny, cospeciation, and coevolution, The University of Chicago Press, 2002.
%H A258485 Sara Billey, Matjaž Konvalinka, and Frederick A. Matsen IV, <a href="http://arxiv.org/abs/1507.04976">On the enumeration of tanglegrams and tangled chains</a>, arXiv:1507.04976 [math.CO], 2015.
%F A258485 t(n) = Sum_{b=(b(1),...,b(t))} Product_{i=2..t} (2(b(i)+...+b(t))-1)^7)/z(b) where the sum is over all binary partitions of n and z(b) is the size of the stabilizer of a permutation of cycle type b under conjugation.
%Y A258485 Cf. A000123 (binary partitions), A258620 (tanglegrams), A258485, A258486, A258487, A258488, A258489 (tangled chains), A259114 (unordered tanglegrams).
%K A258485 nonn
%O A258485 1,3
%A A258485 _Sara Billey_, _Matjaz Konvalinka_, and _Frederick A. Matsen IV_, May 31 2015