34446

Appears in sequences

• a(n) = Sum_{k=0..n} (k+1)*T(n, n-k), where T is given by A008288.at n=10A026937
• Expansion of (3+3*x-25*x^2-3*x^3+2*x^4)/((1-x)*(1-10*x^2+x^4)).at n=9A180483
• 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=42A246343
• Square array: A(row,col) = A003602(A254051(row,col)), read by antidiagonals A(1,1), A(1,2), A(2,1), A(1,3), A(2,2), A(3,1), ...at n=75A254055
• Expansion (x-1)/(x^5+2*x^3+2*x-1).at n=13A257557
• Clique covering number of the n-Sierpinski gasket graph.at n=10A307685
• Number of totally strong compositions of n.at n=20A332274