1635703

Properties

Appears in sequences

• Number of graphs on n labeled nodes with maximal degree exactly 2.at n=8A136284
• Number of ways to place zero or more nonadjacent 1,0 2,1 2,2 3,1 3,3 4,2 4,3 5,4 polyhexes in any orientation on a planar nXnXn triangular grid.at n=11A155445
• Triangle read by rows where T(n,k) is the number of labeled simple graphs with n vertices and minimum vertex-degree k.at n=51A327366
• Prime numbersat n=123665