88193

Appears in sequences

• Number of connected regular graphs of degree 9 with 2n nodes.at n=7A014381
• Quasi-Carmichael numbers to base -7: squarefree composites n such that prime p|n ==> p+7|n+7.at n=16A029567
• Number of 4-valent (or quartic) graphs with n nodes.at n=14A033301
• Irregular triangle C(n,g) counting the connected 9-regular simple graphs on 2n vertices with girth at least g.at n=2A184991
• Number of connected 9-regular simple graphs on 2n vertices with girth exactly 3.at n=7A184993
• Irregular triangle E(n,g) counting not necessarily connected 4-regular simple graphs on n vertices with girth at least g.at n=15A185340
• Number of connected k-regular graphs on 2*n nodes with maximal diameter D(n,k) A296525 written as array T(n,k), 2 <= k < 2*n.at n=37A296526