1213931

Properties

Appears in sequences

• a(n) is the smallest prime == 1 (mod F(n)) where F(n) is the n-th Fibonacci number.at n=25A087384
• a(n) = 10*Fibonacci(n) + (-1)^n.at n=26A372242
• a(n) is the smallest prime number that contains Fibonacci(n) as a substring.at n=26A381099
• Prime numbersat n=93912