24060

Appears in sequences

• Number of n-step self-avoiding walks on diamond.at n=9A001394
• Numbers m such that [A070080(m), A070081(m), A070082(m)] is a right integer triangle.at n=28A070136
• a(n) = 3*n^3 + 3*n.at n=20A119536
• a(n) is the smallest integer k such that the n-th (forward) difference of the partition sequence A000041 is positive from k onwards.at n=36A119712
• Number of walks within N^2 (the first quadrant of Z^2) starting at (0,0) and consisting of n steps taken from {(-1, -1), (-1, 0), (0, -1), (0, 1), (1, -1), (1, 1)}.at n=7A151311
• Rectified 5-cell numbers: the coefficient of x^{2n-2} in (1+x+x^2+ ... + x^{n-1})^5.at n=15A179095
• Number of (w,x,y,z) with all terms in {1,...,n} and w^2>x^2+y^2+z^2.at n=21A212094
• Number of nondecreasing arrays of n 0..n-1 integers with the sum of their 4th powers equal to sum(i^4,i=0..n-1).at n=17A216632
• Number of ballot sequences of length n having exactly nine descents.at n=2A241802
• a(0) = 1, then a(n) = Sum_{k = floor(log_2(n)) .. n - 1} a(k).at n=17A246878
• Numbers that are not Keith numbers in any base.at n=32A320122
• Number of unoriented series-parallel networks with n elements of 2 colors.at n=6A339280