Triangle read by rows: T(n,k) is the number of unordered pairs of nodes at distance k in the n-Dorogovtsev-Goltsev-Mendes graph.

A384844

Triangle read by rows: T(n,k) is the number of unordered pairs of nodes at distance k in the n-Dorogovtsev-Goltsev-Mendes graph.

Terms

    a(0) =3a(1) =9a(2) =6a(3) =27a(4) =57a(5) =21a(6) =81a(7) =351a(8) =369a(9) =60a(10) =243a(11) =1806a(12) =3582a(13) =1716a(14) =156a(15) =729a(16) =8472a(17) =26346a(18) =24216a(19) =6648a(20) =384a(21) =2187a(22) =37683a(23) =165375a(24) =241032a(25) =128880a(26) =22896a(27) =912a(28) =6561a(29) =162177

External references