46214

Appears in sequences

• a(n) = s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n+1-k), where k = [ (n+1)/2 ], s = (Fibonacci numbers), t = (1, p(1), p(2), ...).at n=26A024460
• Numbers k such that k^2, (k+1)^2 and (k+2)^2 are all abundant numbers.at n=15A383391