%I #13 May 17 2024 12:10:55
%S 1,1,2,1,6,5,1,14,28,14,1,30,110,120,42,1,62,375,682,495,132,1,126,
%T 1190,3248,3731,2002,429,1,254,3628,14062,23020,18928,8008,1430,1,510,
%U 10805,57516,127029,144024,91392,31824,4862,1,1022,31740,227030,654395,968544,828495,426360,125970,16796
%N Triangle read by rows: T(n,k) (n >= 1, 1 <= k <= n) = number of normalized 2n-plets associated to trees with k edges.
%H Marc Bauer and Olivier Golinelli, <a href="https://arxiv.org/abs/cond-mat/0007127">Random incidence matrices: Moments of the spectral density</a>, arXiv:cond-mat/0007127 [cond-mat.stat-mech], 2000-2001; J. Stat. Phys. 103, 301-307 (2001).
%H Eva-Maria Hainzl and Élie de Panafieu, <a href="https://arxiv.org/abs/2405.08347">Tree walks and the spectrum of random graphs</a>, arXiv:2405.08347 [math.CO], 2024. See p. 4.
%e Triangle begins:
%e 1;
%e 1, 2;
%e 1, 6, 5;
%e 1, 14, 28, 14;
%e 1, 30, 110, 120, 42;
%e 1, 62, 375, 682, 495, 132;
%e 1, 126, 1190, 3248, 3731, 2002, 429;
%e 1, 254, 3628, 14062, 23020, 18928, 8008, 1430;
%e 1, 510, 10805, 57516, 127029, 144024, 91392, 31824, 4862;
%e 1, 1022, 31740, 227030, 654395, 968544, 828495, 426360, 125970, 16796;
%e ...
%K nonn,tabl
%O 1,3
%A _N. J. A. Sloane_, Nov 20 2017