A136391
a(n) = n*F(n) - (n-1)*F(n-1), where the F(j)‘s are the Fibonacci numbers (F(0)=0, F(1)=1).
offset: 1
codomain: ℕ
Declarations
Section titled “Declarations”- A136391computable
a(n) = n*F(n) - (n-1)*F(n-1), where the F(j)‘s are the Fibonacci numbers (F(0)=0, F(1)=1).