A381099 a(n) is the smallest prime number that contains Fibonacci(n) as a substring.

101, 11, 11, 2, 3, 5, 83, 13, 211, 347, 557, 89, 1447, 233, 2377, 6101, 1987, 1597, 25841, 24181, 67651, 109469, 177113, 28657, 2463683, 1750253, 1213931, 1964189, 2317811, 514229, 8320409, 13462693, 22178309, 35245781, 135702887, 192274651, 149303521

Offset: 0

Author

Gonzalo Martínez, Feb 13 2025

Keywords

• nonn
• base

Comments

If Fibonacci(n) is itself prime (n in A001605), then a(n) = Fibonacci(n).

Examples

			For n = 6, since Fibonacci(6) = 8, the smallest prime that contains 8 as a substring is 83, so a(6) = 83.
		

Crossrefs

Cf. A000040, A000045, A001605, A062584.

Formula

a(n) = A062584(A000045(n)).