21709

Appears in sequences

• a(n) = T(n,n-3), where T is the array in A026386.at n=33A026394
• Number of ways prime(n) can be expressed as the sum of distinct smaller noncomposites.at n=50A215966
• Decimal representation of the diagonal from the corner to the origin of the n-th stage of growth of the two-dimensional cellular automaton defined by "Rule 470", based on the 5-celled von Neumann neighborhood.at n=28A288496
• Array read by upwards antidiagonals: T(m,n) = number of set partitions into distinct parts of the multiset consisting of one copy each of x_1, x_2, ..., x_m, and two copies each of y_1, y_2, ..., y_n, for m >= 0, n >= 0.at n=31A322770
• Column 3 of array in A322770.at n=4A322774
• Squares where A323809 gets stuck.at n=13A323813
• Number of partitions of the (n+7)-multiset {1,2,...,n,1,2,...,7} into distinct multisets.at n=3A346900