This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A381099 #10 Mar 02 2025 23:47:31 %S A381099 101,11,11,2,3,5,83,13,211,347,557,89,1447,233,2377,6101,1987,1597, %T A381099 25841,24181,67651,109469,177113,28657,2463683,1750253,1213931, %U A381099 1964189,2317811,514229,8320409,13462693,22178309,35245781,135702887,192274651,149303521 %N A381099 a(n) is the smallest prime number that contains Fibonacci(n) as a substring. %C A381099 If Fibonacci(n) is itself prime (n in A001605), then a(n) = Fibonacci(n). %F A381099 a(n) = A062584(A000045(n)). %e A381099 For n = 6, since Fibonacci(6) = 8, the smallest prime that contains 8 as a substring is 83, so a(6) = 83. %Y A381099 Cf. A000040, A000045, A001605, A062584. %K A381099 nonn,base %O A381099 0,1 %A A381099 _Gonzalo MartÃnez_, Feb 13 2025