The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A195378 Numbers n such that n-th Fibonacci number has all digits 0 to 9. 0
 61, 63, 74, 92, 98, 100, 105, 107, 109, 113, 118, 119, 120, 121, 122, 126, 127, 128, 130, 131, 132, 134, 136, 138, 139, 140, 146, 147, 148, 149, 150, 151, 152, 153, 154, 155, 156, 157, 158, 159, 160, 162, 163, 165, 167, 168, 169, 170, 171, 172, 173, 175, 176 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 COMMENTS Brian Trial conjectures that all Fibonacci numbers greater than F285 are pandigital, see the Gupta link. It is easy to show that these numbers have positive lower density. [Charles R Greathouse IV, Sep 18 2011] LINKS Shyam Sunder Gupta, Can you find (CYF) FORMULA Conjecture: a(n) = n + 131 for n > 154. MATHEMATICA Select[Range[1000], Union[IntegerDigits[Fibonacci[#]]] == Range[0, 9] &] (* T. D. Noe, Sep 20 2011 *) PROG (PARI) is(n)=#vecsort(Vec(Str(fibonacci(n))), , 8)==10 \\ Charles R Greathouse IV, Sep 18 2011 CROSSREFS Sequence in context: A042859 A258157 A114085 * A260561 A295805 A295157 Adjacent sequences:  A195375 A195376 A195377 * A195379 A195380 A195381 KEYWORD nonn,base AUTHOR Kausthub Gudipati, Sep 17 2011 EXTENSIONS Corrected by T. D. Noe, Sep 20 2011 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified August 8 19:29 EDT 2020. Contains 336298 sequences. (Running on oeis4.)