cp's OEIS Frontend

A132365 Least number k such that the Lucas number A000032(k) contains n.

%I A132365 #12 Jun 07 2017 00:35:09
%S A132365 1,0,2,3,13,9,4,6,7,24,5,10,15,26,20,25,49,6,11,16,13,12,10,21,45,40,
%T A132365 20,36,7,31,50,12,35,19,17,15,41,36,22,23,39,39,14,21,41,60,8,32,19,
%U A132365 56,20,13,45,37,51,44,17,56,42,22,25,62,35,15,71,47,25,24,43,32,17,45,49,38
%N A132365 Least number k such that the Lucas number A000032(k) contains n.
%C A132365 Values such that a(n)=n (fixed points) are 1, 62. I don't know if there are any other fixed points. The first time a(n)=a(n+1) occurs because L(39)=141422324 which includes both 41 and 42 (and later on in the sequence, because it contains 141 and 142). [_Sean A. Irvine_, Nov 30 2009]
%H A132365 Chai Wah Wu, <a href="/A132365/b132365.txt">Table of n, a(n) for n = 1..10000</a>
%F A132365 a(n) = Min{k such that A000032(k) contains the decimal digit substring which represents the integer n}.
%o A132365 (Python)
%o A132365 def A132365(n):
%o A132365     a, b, m, s = 2, 1, 0, str(n)
%o A132365     while True:
%o A132365         if s in str(a):
%o A132365             return m
%o A132365         m += 1
%o A132365         a, b = b, a+b # _Chai Wah Wu_, Jun 06 2017
%Y A132365 Cf. A000032, A000045, A000350, A050816, A038546, A052000, A023172.
%K A132365 base,easy,nonn
%O A132365 1,3
%A A132365 _Jonathan Vos Post_, Nov 08 2007
%E A132365 Incorrect comment removed by _Sean A. Irvine_, Nov 30 2009
%E A132365 Corrected and extended by _Sean A. Irvine_, Nov 30 2009