86191
domain: N
Appears in sequences
- a(1) = 1; for n > 1, a(n) = smallest k such that a(n-1)^3 + k is a cube.at n=3A172027
- Number of Frobenius partitions of 2*n that satisfy the condition that the sum of the entries on the top row plus the number of columns is less than or equal to the sum of the entries on the bottom row.at n=24A342208
- Numbers k for which A276085(k) is a multiple of 3125, where A276085 is fully additive with a(p) = p#/p.at n=32A377878