53115

Appears in sequences

• Number of partitions satisfying 0 < cn(0,5) + cn(1,5) + cn(2,5) + cn(3,5) and 0 < cn(0,5) + cn(4,5) + cn(2,5) + cn(3,5).at n=42A039903
• Number of binary necklaces of length n with no subsequence 000.at n=22A093305
• Number of 2-divided words of length n over a 3-letter alphabet.at n=9A210323
• a(n) = smallest number k such that (k + n)' = k', or -1 if no such number exists, where k' is the arithmetic derivative of k.at n=18A255354
• Irregular triangle read by rows: T(n, k) is the number of chains of subspaces 0 < V_1 < ... < V_r = (F_2)^n, counted up to coordinate permutation, with dimension increments given by (any fixed permutation of) the parts of the k-th partition of n in Abramowitz-Stegun order.at n=61A348113