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

 

Logo

Please make a donation to keep the OEIS running. We are now in our 55th year. In the past year we added 12000 new sequences and reached 8000 citations (which often say "discovered thanks to the OEIS"). We need to raise money to hire someone to manage submissions, which would reduce the load on our editors and speed up editing.
Other ways to donate

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A263579 Numbers n such that n and Fibonacci(n) have no common digits. 1
2, 3, 4, 6, 7, 8, 9, 10, 11, 14, 16, 20, 22, 27, 34, 66 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,1

COMMENTS

There are no more terms <= 100000.

This is the complement of A263580.

LINKS

Table of n, a(n) for n=0..15.

EXAMPLE

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

MATHEMATICA

Select[Range[0, 80], IntersectingQ[IntegerDigits@ #, IntegerDigits@ Fibonacci@ #] == False &] (* Michael De Vlieger, Oct 22 2015 *)

PROG

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

CROSSREFS

Cf. A000045, A263580.

Sequence in context: A039214 A032866 A014155 * A166527 A039223 A028392

Adjacent sequences:  A263576 A263577 A263578 * A263580 A263581 A263582

KEYWORD

nonn,base

AUTHOR

Colin Barker, Oct 22 2015

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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified December 11 23:44 EST 2019. Contains 329945 sequences. (Running on oeis4.)