66410

Appears in sequences

• Number of simple unlabeled n-node graphs of connectivity 3.at n=8A052444
• Numbers m such that the sum of the factorials of their digits is equal to the reversal of m.at n=5A101702
• Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, 0, 0), (0, -1, 1), (0, 0, 1), (1, 1, -1)}.at n=11A148354
• Triangle read by rows: T(n,k) = number of unlabeled graphs with n nodes and connectivity exactly k (n>=1, 0<=k<=n-1).at n=39A259862
• Let p = n-th prime == 3 mod 8; a(n) = sum of quadratic nonresidues mod p that are < p/2.at n=45A282724
• a(n) is the number of partitions of n with Durfee square of size <= 4.at n=44A330642