Let p = prime(n). Then a(n) = Fibonacci(p+1)/p if this is an integer, otherwise a(n) = Fibonacci(p-1)/p if this is an integer, and fall back to a(n)=0 if both are non-integer.

A176951

Let p = prime(n). Then a(n) = Fibonacci(p+1)/p if this is an integer, otherwise a(n) = Fibonacci(p-1)/p if this is an integer, and fall back to a(n)=0 if both are non-integer.

Terms

    a(0) =1a(1) =1a(2) =0a(3) =3a(4) =5a(5) =29a(6) =152a(7) =136a(8) =2016a(9) =10959a(10) =26840a(11) =1056437a(12) =2495955a(13) =16311831a(14) =102287808a(15) =1627690024a(16) =10021808981a(17) =25377192720

External references