62616

Appears in sequences

• Triangle read by rows: T(n,k) is the number of simple regular connected bipartite graphs with 2n nodes and degree k, (2 <= k <= n).at n=40A008326
• Triangle read by rows: T(n,k) is the number of simple regular bipartite graphs with 2n nodes and degree k, (0 <= k <= n).at n=59A008327
• Triangle read by rows: T(n,k) is the number of simple regular bipartite graphs with 2n nodes and degree k, (0 <= k <= n).at n=61A008327
• Number of connected regular bipartite graphs of degree 6 with 2n nodes.at n=4A014385
• Triangle T(n, k) = Fibonacci(2*k)*T(n-1, k) + Fibonacci(2*(n-k+1))*T(n-1, k-1), with T(n, 1) = T(n, n) = 1, read by rows.at n=23A141688
• Triangle T(n, k) = Fibonacci(2*k)*T(n-1, k) + Fibonacci(2*(n-k+1))*T(n-1, k-1), with T(n, 1) = T(n, n) = 1, read by rows.at n=25A141688
• Number of simple 4-regular bipartite graphs with 2n nodes.at n=9A333730