72085

Appears in sequences

• a(n) = 1*t(n) + 2*t(n-1) + ... + k*t(n+1-k), where k=floor((n+1)/2) and t = (F(2), F(3), F(4), ...), F(n) = Fibonacci(n).at n=19A023864
• a(n) = s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n-k+1), where k = [ n/2 ], s = (natural numbers), t = (Fibonacci numbers).at n=19A024857
• a(n) = s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n-k+1), where k = [ n/2 ], s = (natural numbers), t = (F(2), F(3), F(4), ... ).at n=18A024861
• Numbers n such that phi(n-1) + phi(n+1) = phi(2n).at n=19A067701
• One fifth of product plus sum of five consecutive nonnegative numbers.at n=11A166942
• The cell number where a knight is trapped when moving on a spirally numbered hexagonal board to the lowest available unvisited cell and starting at cell n.at n=0A333684