26094

Appears in sequences

• Number of positive increasing integer sequences of length n with Gilbreath transform (that is, the diagonal of leading successive absolute differences) given by {1,1,1,1,1,...}.at n=8A080839
• a(n) = n^3 + 73*n^2 + n + 67.at n=17A163303
• a(0) = 12, 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=40A246343
• Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 139", based on the 5-celled von Neumann neighborhood.at n=33A270280
• Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 158", based on the 5-celled von Neumann neighborhood.at n=41A270335
• Number of simple chord-labeled chord diagrams with n chords.at n=6A278992
• Number of even parts in the partitions of n into 7 parts.at n=49A309625