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!)
A263579 Numbers n such that n and Fibonacci(n) have no common digits. 1

%I #9 Oct 24 2015 12:08:11

%S 2,3,4,6,7,8,9,10,11,14,16,20,22,27,34,66

%N Numbers n such that n and Fibonacci(n) have no common digits.

%C There are no more terms <= 100000.

%C This is the complement of A263580.

%e 66 is in the sequence because Fibonacci(66) = 27777890035288, which has no digits in common with 66.

%t Select[Range[0, 80], IntersectingQ[IntegerDigits@ #, IntegerDigits@ Fibonacci@ #] == False &] (* _Michael De Vlieger_, Oct 22 2015 *)

%o (PARI) s=[]; for(n=0, 1000, if(setintersect(vecsort(digits(n), , 8), vecsort(digits(fibonacci(n)), , 8))==[], s=concat(s, n))); s

%Y Cf. A000045, A263580.

%K nonn,base

%O 0,1

%A _Colin Barker_, Oct 22 2015

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 23 06:04 EDT 2024. Contains 371906 sequences. (Running on oeis4.)