Triangle read by rows: T(n,k) is the number of graceful Prüfer codes on n vertices whose last element equals k (0 <= k <= n-1).

A392515

Triangle read by rows: T(n,k) is the number of graceful Prüfer codes on n vertices whose last element equals k (0 <= k <= n-1).

Terms

    a(0) =1a(1) =0a(2) =1a(3) =2a(4) =1a(5) =0a(6) =1a(7) =7a(8) =2a(9) =1a(10) =0a(11) =2a(12) =23a(13) =10a(14) =2a(15) =1a(16) =0a(17) =4a(18) =97a(19) =38a(20) =11a(21) =4a(22) =2a(23) =0a(24) =12a(25) =448a(26) =180a(27) =50a(28) =20a(29) =10

External references