138969

Appears in sequences

• a(n) = Fibonacci(n) + n^3.at n=26A212272
• Main diagonal of A332369.at n=29A332370
• Number of configurations of the 7 X 2 variant of the sliding block 15-puzzle that require a minimum of n moves to be reached, starting with the empty square in one of the corners.at n=23A346736
• For positive integers n, a multiset A of positive integers is called "n-good" if for any number 1 <= i <= n, we can find a submultiset B of A such that the sum of B is equal to i. a(n) is the number of minimal n-good multisets.at n=36A385675