A136174 Fibonacci numbers that contain all the digits 0 to 9 at least once.

2504730781961, 6557470319842, 1304969544928657, 7540113804746346429, 135301852344706746049, 354224848179261915075, 3928413764606871165730, 10284720757613717413913, 26925748508234281076009

Offset

1,1

Comments

The Fibonacci indices of the terms are 61, 63, 74, 92, 98, 100, 105, 107, 109, 113, ..., . - Robert G. Wilson v, Mar 26 2008

Links

Harvey P. Dale, Table of n, a(n) for n = 1..1000

Nathan Egge and Aaron Krowne, List of Fibonacci numbers, Planet Math.

Example

The Fibonacci number 2504730781961 contains all the digits 0 to 9 at least once.

Maple

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

Mathematica

Fibonacci[Select[Range[300], Min[DigitCount[Fibonacci[ # ]]] > 0 &]] (* Stefan Steinerberger, Mar 26 2008 *)
Select[Fibonacci[Range[200]], Min[DigitCount[#]]>0&] (* Harvey P. Dale, Apr 21 2022 *)

Crossrefs

Cf. A000045.

Sequence in context: A034658 A317289 A361935 * A233496 A233617 A323052

Adjacent sequences: A136171 A136172 A136173 * A136175 A136176 A136177

Keyword

nonn,base

Author

Parthasarathy Nambi, Mar 16 2008

Extensions

More terms from Stefan Steinerberger and Robert G. Wilson v, Mar 26 2008

Status

approved