64520

Appears in sequences

• MacMahon's solid partitions of n in which 2 is the smallest summand.at n=14A002043
• Number of ways of numbering the faces of a cube with nonnegative integers so that the sum of the 6 numbers is n.at n=42A054473
• Irregular triangle read by rows: T(n,k) = number of unsigned unichromosonal genomes with n genes at 3-break distance k from a fixed genome, 0 <= k <= floor(n/2).at n=32A264614
• Number of connected minimal dominating sets in the n X n torus grid graph.at n=7A295429
• Number T(n,k) of colored integer partitions of n using all colors of a k-set such that all parts have different color patterns and a pattern for part i has i distinct colors in increasing order; triangle T(n,k), n>=0, min(j:A001787(j)>=n)<=k<=n, read by rows.at n=31A326914
• Totient numbers where a record gap appears in the list (A002202).at n=10A392633