|
%I #18 Apr 21 2022 14:06:19
%S 2504730781961,6557470319842,1304969544928657,7540113804746346429,
%T 135301852344706746049,354224848179261915075,3928413764606871165730,
%U 10284720757613717413913,26925748508234281076009
%N Fibonacci numbers that contain all the digits 0 to 9 at least once.
%C The Fibonacci indices of the terms are 61, 63, 74, 92, 98, 100, 105, 107, 109, 113, ..., . - _Robert G. Wilson v_, Mar 26 2008
%H Harvey P. Dale, <a href="/A136174/b136174.txt">Table of n, a(n) for n = 1..1000</a>
%H Nathan Egge and Aaron Krowne, <a href="https://planetmath.org/listoffibonaccinumbers">List of Fibonacci numbers</a>, Planet Math.
%e The Fibonacci number 2504730781961 contains all the digits 0 to 9 at least once.
%p with(combinat): a:=proc(n) if `subset`({0, 1, 2, 3, 4, 5, 6, 7, 8, 9}, convert(convert(fibonacci(n), base, 10), set)) = true then fibonacci(n) else end if end proc: seq(a(n),n=1..110); # _Emeric Deutsch_, Apr 06 2008
%t Fibonacci[Select[Range[300], Min[DigitCount[Fibonacci[ # ]]] > 0 &]] (* _Stefan Steinerberger_, Mar 26 2008 *)
%t Select[Fibonacci[Range[200]],Min[DigitCount[#]]>0&] (* _Harvey P. Dale_, Apr 21 2022 *)
%Y Cf. A000045.
%K nonn,base
%O 1,1
%A _Parthasarathy Nambi_, Mar 16 2008
%E More terms from _Stefan Steinerberger_ and _Robert G. Wilson v_, Mar 26 2008
|
