26853

Appears in sequences

• Odd composites (including 1 in the count) where the number 1 mod 4 equals the number 3 mod 4.at n=2A093180
• a(0) = 16, after which, if (2*a(n-1)) - 1 = product_{k >= 1} (p_k)^(c_k) then a(n) = product_{k >= 1} (p_{k-1})^(c_k), where p_k indicates the k-th prime, A000040(k).at n=26A246345
• Triangle read by rows. Number T(n, k) of partitions of the multiset [1, 1, 1, 2, 2, 2, ..., n, n, n] into k nonempty submultisets, for 1 <= k <= 3n.at n=40A358721