94860

Appears in sequences

• a(n) = n*(n + 1)*(n^2 - 3*n + 6)/8.at n=29A004255
• Let sigma_m (n) be result of applying sum-of-divisors function m times to n; call n (m,k)-perfect if sigma_m (n) = k*n; sequence gives the (3,k)-perfect numbers.at n=30A019292
• Duplicate of A004255.at n=30A101357
• Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, 0), (0, 0, -1), (0, 1, -1), (0, 1, 0), (1, 0, 1)}.at n=9A150216
• Weight distribution of [255,55,63] primitive binary BCH code.at n=70A151934
• a(n) = n*(n+1)*(7*n-6)/2.at n=30A256718
• Number of permutations f of {1,...,n} such that k!*f(k) + 1 is prime for every k from 1 to n.at n=16A321805
• a(n) = Sum_{k=0..floor(n/4)} binomial(n-1-3*k,n-4*k) * binomial(2*k,k).at n=26A360310
• Place n points in general position on each side of an equilateral triangle, and join every pair of the 3*n+3 boundary points by a chord; sequence gives number of vertices in the resulting planar graph.at n=14A367117