19355

Appears in sequences

• Number of trivalent (or cubic) labeled graphs with 2n nodes.at n=4A002829
• Number of 4-valent labeled graphs with n nodes.at n=8A005815
• Numbers k such that 5*2^k - 3 is prime.at n=43A058588
• Triangle T(n,k) (n >= 1, 0 <= k <= n-1) giving number of regular labeled graphs with n nodes and degree k, read by rows.at n=31A059441
• Triangle T(n,k) (n >= 1, 0 <= k <= n-1) giving number of regular labeled graphs with n nodes and degree k, read by rows.at n=32A059441
• Number of decimal digits in A001042.at n=18A064236
• Number of n X n binary arrays symmetric about both diagonal and antidiagonal with all ones connected only in a 1100-1000-1111 pattern in any orientation.at n=16A146686
• Number of n X n binary arrays with all ones connected only in a 1100-1111-0100-0100 pattern in any orientation.at n=8A147467
• Number of n X n binary arrays symmetric under horizontal and vertical reflection with all ones connected only in a 1100-1111-0100-0100 pattern in any orientation.at n=18A147469
• Number of n X n binary arrays symmetric under horizontal and vertical reflection with all ones connected only in a 1100-1111-0100-0100 pattern in any orientation.at n=19A147469
• Number of (w,x,y,z) with all terms in {1,...,n} and w*x+y*z>=n^2.at n=21A212132
• Expansion of e.g.f. Sum_{n>=0} (n+1)^(n-1) * sinh(x)^n / n!.at n=6A219503
• Number of (n+2) X (4+2) 0..4 arrays with every consecutive three elements in every row and column not having exactly two distinct values, and in every diagonal and antidiagonal having exactly two distinct values, and new values 0 upwards introduced in row major order.at n=9A252807
• Composites whose prime factorization in base 3 is an anagram of the number in base 3.at n=36A260047
• Number of connected 4-regular (or quartic) labeled graphs with n nodes.at n=7A272905
• Triangle read by rows: T(n,k) is the number of connected k-regular simple graphs on n labeled vertices, (0 <= k < n).at n=32A324163
• Numerators of sequence whose Dirichlet convolution with itself yields A342920.at n=80A346103
• Number of n-regular graphs on 2*n labeled nodes.at n=4A361254