251758

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=22A006490
• Fibonacci sequence beginning 0, 23.at n=21A022357
• Numbers n such that prime(n) == -9 (mod n).at n=17A092051
• Numbers n such that either prime(n-1) == -1 (mod n) or prime(n+1) == -1 (mod n) but not both.at n=36A225318
• a(n) = n*Fibonacci(n-2) + ((-1)^n + 1)/2.at n=23A323812