29900

Appears in sequences

• Number of walks on cubic lattice.at n=12A005571
• a(n) = 2*binomial(n,4).at n=26A034827
• Triangle read by rows: T(n,k) = number of configurations of k non-attacking bishops on the white squares of an n X n chessboard (for n even, 0 <= k < n).at n=33A088960
• a(n) = n*(n+1)*(11*n+1)/6.at n=25A132112
• Sequence defined by the recurrence formula a(n+1)=sum(a(p)*a(n-p)+k,p=0..n)+l for n>=1, with here a(0)=1, a(1)=2, k=-1 and l=0.at n=10A176856
• Imbalance of the number of parts of all partitions of n.at n=40A194796
• Magic sums of 4 X 4 magic squares composed of odd squares.at n=9A271582
• Lesser of amicable pair m < n defined by t(n) = m and t(m) = n where t(n) = psi(n) - n and psi(n) = A001615(n) is the Dedekind psi function.at n=16A323329
• a(n) = n*(n + 1)*(n^2 + 17*n + 54)/24.at n=25A387204