Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #4 Mar 03 2014 12:14:20
%S 1,2,3,4,5,6,7,8,2,10,7,12,13,14,15,16,17,18,19,5,21,22,23,24,25,26,
%T 27,28,29,6,31,7,12,34,35,36,37,38,19,21,41,42,43,44,45,46,47,48,49,
%U 50,51,52,53,54,55,56,57,32,59,60,61,11,63,33,12,7,66,68
%N Smallest m such that the n-th prime occurs as substring in A019518(n).
%C a(n) <= n; see A165450 for earley bird primes: A165450(n) = A000040(m) with a(m) < m.
%H Reinhard Zumkeller, <a href="/A238593/b238593.txt">Table of n, a(n) for n = 1..3333</a>
%e n=10, prime(10)=29 occurs first in A019518(10)=2357111317192329, therefore a(10) = 10;
%e prime(11)=31 occurs already in A019518(7)=2357111317, therefore a(11) = 7.
%o (Haskell)
%o import Data.List (isInfixOf, findIndex); import Data.Maybe (fromJust)
%o a238593 n = (+ 1) $ fromJust $ findIndex
%o (isInfixOf $ show $ a000040 n) (scanl1 (++) $ map show a000040_list)
%K nonn,base
%O 1,2
%A _Reinhard Zumkeller_, Mar 03 2014