181227

Appears in sequences

• Number of trivalent connected simple graphs with 2n nodes and girth at least 6.at n=13A014374
• Irregular triangle C(n,g) counting connected trivalent simple graphs on 2n vertices with girth at least g.at n=39A185131
• Irregular triangle E(n,g) counting not necessarily connected 3-regular simple graphs on 2n vertices with girth at least g.at n=39A185330
• Number of not necessarily connected 3-regular simple graphs on 2n vertices with girth at least 6.at n=13A185336
• Irregular triangle C(n,k): the number of connected k-regular graphs on n vertices having girth at least six.at n=84A186716
• Number of nX3 0..1 arrays with every element equal to 0, 1, 2, 3 or 6 horizontally, vertically or antidiagonally adjacent elements, with upper left element zero.at n=6A326100
• Number of nX7 0..1 arrays with every element equal to 0, 1, 2, 3 or 6 horizontally, vertically or antidiagonally adjacent elements, with upper left element zero.at n=2A326104
• T(n,k)=Number of nXk 0..1 arrays with every element equal to 0, 1, 2, 3 or 6 horizontally, vertically or antidiagonally adjacent elements, with upper left element zero.at n=38A326105
• T(n,k)=Number of nXk 0..1 arrays with every element equal to 0, 1, 2, 3 or 6 horizontally, vertically or antidiagonally adjacent elements, with upper left element zero.at n=42A326105