1205568

Appears in sequences

• a(1) = 1, a(2) = 0; for n > 2, a(n) = n*Fibonacci(n-2) (with the convention Fibonacci(0)=0, Fibonacci(1)=1).at n=25A006490
• Fibonacci sequence beginning 0, 26.at n=24A022360
• a(n) = n-th quintic factorial number divided by 3.at n=5A034300
• a(n) = (n+1)*a(n-5), with a(0)=a(1)=a(2)=a(3)=a(4)=1.at n=27A081408