cp's OEIS Frontend

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.

A217176 a(n) is the first digit (from the left) to appear n times in succession in the decimal representation of the Lucas(A217166(n)).

This page as a plain text file.
%I A217176 #19 Mar 12 2025 18:43:42
%S A217176 2,1,3,0,2,2,9,7,2,1,1,5,5,7,7,9
%N A217176 a(n) is the first digit (from the left) to appear n times in succession in the decimal representation of the Lucas(A217166(n)).
%t A217176 k = 0; Join[{2}, Table[While[d = IntegerDigits[LucasL[k]]; prt = Partition[Differences[d], n - 1, 1]; ! MemberQ[prt, Table[0, {n - 1}]], k++]; d[[Position[prt, Table[0, {n - 1}]][[1, 1]]]], {n, 2, 8}]] (* _T. D. Noe_, Oct 03 2012 *)
%o A217176 (Python)
%o A217176 def A217176(n):
%o A217176     if n == 1:
%o A217176         return 2
%o A217176     else:
%o A217176         l, y, x = [str(d)*n for d in range(10)], 2, 1
%o A217176         for m in range(1, 10**9):
%o A217176             s = str(x)
%o A217176             for k in range(10):
%o A217176                 if l[k] in s:
%o A217176                     return k
%o A217176             y, x = x, y+x
%o A217176         return 'search limit reached'
%o A217176 # _Chai Wah Wu_, Dec 17 2014
%Y A217176 Cf. A217166.
%Y A217176 Cf. A000032, A215732, A215733, A215734, A215735, A215736, A215737.
%K A217176 nonn,base,hard
%O A217176 1,1
%A A217176 _V. Raman_, Sep 27 2012
%E A217176 a(11) from _Chai Wah Wu_, Dec 17 2014
%E A217176 a(12)-a(16) from _Nick Hobson_, Feb 03 2024