27981

Appears in sequences

• Sieve performed by successive iterations of steps where step m is: keep m terms, remove the next 3 and repeat; as m = 1,2,3,.. the remaining terms form this sequence.at n=20A112561
• Triangle T(n, k, m) = (m*(n-k) + 1)*T(n-1, k-1, m) + (m*k + 1)*T(n-1, k, m) + m*k*(n-k)*T(n-2, k-1, m) with T(n, 0, m) = T(n, n, m) = 1 and m = 5, read by rows.at n=22A157151
• Triangle T(n, k, m) = (m*(n-k) + 1)*T(n-1, k-1, m) + (m*k + 1)*T(n-1, k, m) + m*k*(n-k)*T(n-2, k-1, m) with T(n, 0, m) = T(n, n, m) = 1 and m = 5, read by rows.at n=26A157151
• a(n) = Sum_{i=0..n} digsum(i)^3, where digsum(i) = A007953(i).at n=56A231688
• Number of integer partitions of n with frequency depth floor(sqrt(n)).at n=42A325252
• Number of integer partitions of n with frequency depth round(sqrt(n)).at n=42A325271
• a(n) is the end square spiral number for a knight starting on square n moving on a board with squares numbered with the square of their distance from the 0-square origin and where the knight moves to the smallest numbered unvisited square; the smallest spiral number ordering is used if the distances are equal.at n=27A326931
• a(n) = greatest number in row n of the array in A225485.at n=41A364810