24906

Appears in sequences

• a(n) = p(1)p(n) + p(2)p(n-1) + ... + p(k)p(n-k+1), where k = [ n/2 ], p = A000040, the primes.at n=30A025129
• Numbers k such that the three second-degree cyclotomic polynomials x^2 + 1, x^2 - x + 1 and x^2 + x + 1 are simultaneously prime when evaluated at x=k.at n=17A087277
• Numbers n such that s=n^2 gives prime quadruples (30s+11, 30s+13, 30s+17, 30s+19).at n=5A087772
• Coefficients of certain polynomials related to array A078740 ((3,2)-Stirling2).at n=44A091741
• Similar to A137284, but considering Sum{ k = 1,2,3,... } 5^(-nk).at n=26A136275
• Number of partitions of n+9 with largest inscribed rectangle having area <= n.at n=29A218630
• Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 225", based on the 5-celled von Neumann neighborhood.at n=33A270944
• Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 246", based on the 5-celled von Neumann neighborhood.at n=37A271010
• a(n) is the number of overpartitions of n where overlined parts are not divisible by 3 and non-overlined parts are congruent to 1 modulo 3.at n=45A335754
• E.g.f. satisfies log(A(x)) = (exp(x * A(x)) - 1)^3 / 6.at n=8A357032
• Number T(n,k) of partitions of [n] having exactly k blocks of maximal size; triangle T(n,k), n>=0, 0<=k<=n, read by rows.at n=57A372722