64432

Appears in sequences

• a(n) = a(1) + a(2) + ... + a(n-1) + a(m), where m = 2^(p+1) + 2 - n and p is the unique integer such that 2^p < n-1 <= 2^(p+1), starting with a(1) = a(2) = 1.at n=16A049941
• Records of minima of A154333, difference of a cube minus the next smaller square.at n=19A179386
• Triangle read by rows: T(n,k) is the number of strict multiset partitions of normal multisets of size n into k blocks, where a multiset is normal if it spans an initial interval of positive integers.at n=46A330787
• a(n) is the least positive integer k such that Mordell's equation y^2 = x^3 - k has exactly n integer solutions with y >= 0.at n=13A392395