login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A136174 Fibonacci numbers that contain all the digits 0 to 9 at least once. 1
2504730781961, 6557470319842, 1304969544928657, 7540113804746346429, 135301852344706746049, 354224848179261915075, 3928413764606871165730, 10284720757613717413913, 26925748508234281076009 (list; graph; refs; listen; history; internal format)
OFFSET

1,1

COMMENTS

The Fibonacci indices of A136174 are 61, 63, 74, 92, 98, 100, 105, 107, 109, 113, ..., . - Robert G. Wilson v (rgwv(AT)rgwv.com), Mar 26 2008

LINKS

Nathan Egge and Aaron Krowne, 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 (deutsch(AT)duke.poly.edu), Apr 06 2008

MATHEMATICA

Fibonacci[Select[Range[300], Min[DigitCount[Fibonacci[ # ]]] > 0 &]] - Stefan Steinerberger (stefan.steinerberger(AT)gmail.com), Mar 26 2008

CROSSREFS

Cf. A000045.

Sequence in context: A172598 A077304 A034658 * A015434 A017292 A017400

Adjacent sequences:  A136171 A136172 A136173 * A136175 A136176 A136177

KEYWORD

nonn,base

AUTHOR

Parthasarathy Nambi (PachaNambi(AT)yahoo.com), Mar 16 2008

EXTENSIONS

More terms from Stefan Steinerberger (stefan.steinerberger(AT)gmail.com) and Robert G. Wilson v (rgwv(AT)rgwv.com), Mar 26 2008

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 17 15:54 EST 2012. Contains 206050 sequences.