login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
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

%I #18 Dec 28 2021 11:56:09

%S 61,63,74,92,98,100,105,107,109,113,118,119,120,121,122,126,127,128,

%T 130,131,132,134,136,138,139,140,146,147,148,149,150,151,152,153,154,

%U 155,156,157,158,159,160,162,163,165,167,168,169,170,171,172,173,175,176

%N Numbers n such that n-th Fibonacci number has all digits 0 to 9.

%C Brian Trial conjectures that all Fibonacci numbers greater than F285 are pandigital, see the Gupta link.

%C It is easy to show that these numbers have positive lower density. [_Charles R Greathouse IV_, Sep 18 2011]

%H Shyam Sunder Gupta, <a href="http://www.shyamsundergupta.com/canyoufind.htm">Can you find (CYF)</a>

%F Conjecture: a(n) = n + 131 for n > 154.

%t Select[Range[1000], Union[IntegerDigits[Fibonacci[#]]] == Range[0, 9] &] (* _T. D. Noe_, Sep 20 2011 *)

%t Select[Range[200],Min[DigitCount[Fibonacci[#]]]>0&] (* _Harvey P. Dale_, Dec 28 2021 *)

%o (PARI) is(n)=#vecsort(Vec(Str(fibonacci(n))),,8)==10 \\ _Charles R Greathouse IV_, Sep 18 2011

%K nonn,base

%O 1,1

%A _Kausthub Gudipati_, Sep 17 2011

%E Corrected by _T. D. Noe_, Sep 20 2011

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 25 08:27 EDT 2024. Contains 371964 sequences. (Running on oeis4.)