# Greetings from The On-Line Encyclopedia of Integer Sequences! http://oeis.org/

Search: id:a115937
Showing 1-1 of 1

%I A115937 #12 Jul 15 2021 10:17:35
%S A115937 130,190,309,348,374,381,382,387,394,431,447,482,496,513,516,522,540,
%T A115937 543,562,573,590,600,603,667,672,738,761,768,827,843,849,856,873,888,
%U A115937 907,912,923,937,958,963,982,990,993,1009,1021,1027,1054,1087,1090
%N A115937 Numbers k such that the k-th Fibonacci number contains a pandigital substring.
%H A115937 Harvey P. Dale, <a href="/A115937/b115937.txt">Table of n, a(n) for n = 1..10000</a>
%e A115937 Fibonacci(130) = 65(9034621587)630041982498215.
%t A115937 pandQ[n_]:=AnyTrue[Partition[IntegerDigits[Fibonacci[n]],10,1],Sort[#] == Range[ 0,9]&]; Select[Range[1100],pandQ] (* The program uses the AnyTrue function from Mathematica version 10 *) (* _Harvey P. Dale_, Apr 24 2016 *)
%o A115937 (Python)
%o A115937 from functools import lru_cache
%o A115937 @lru_cache(maxsize=None)
%o A115937 def fib(n): return n if n < 2 else fib(n-1) + fib(n-2)
%o A115937 def haspan(s): return any(len(set(s[i:i+10]))==10 for i in range(len(s)-9))
%o A115937 print([m for m in range(1111) if haspan(str(fib(m)))]) # _Michael S. Branicky_, Feb 28 2021
%Y A115937 Cf. A115933, A115934, A115935, A115936, A115938.
%K A115937 nonn,base
%O A115937 1,1
%A A115937 _Giovanni Resta_, Feb 06 2006

# Content is available under The OEIS End-User License Agreement: http://oeis.org/LICENSE