This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A136340 Fibonacci numbers where every digit is a prime. 1
 2, 3, 5, 55, 233, 377 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 COMMENTS Is this sequence finite? No more terms < Fibonacci(10^7) ~ 10^2089876. LINKS Nathan Egge and Aaron Krowne, Planet Math. EXAMPLE 377 is a Fibonacci number in which every digit is a prime. PROG (PARI) {for (n=2, 10^9,     F = fibonacci(n);  q = 1;     while ( F, if ( !isprime(F%10), q=0; break() ); F\=10 );     if ( q, print1(fibonacci(n), ", ") );     if ( bitand(n, 4095)==0, print([n]) ); /* document how far search went */ ); } (MAGMA) [ k: n in [1..70000] | forall{ d: d in Intseq(k) | IsPrime(d) } where k is Fibonacci(n) ]; CROSSREFS Cf. A000045. Sequence in context: A060085 A114370 A114725 * A029961 A083665 A214752 Adjacent sequences:  A136337 A136338 A136339 * A136341 A136342 A136343 KEYWORD nonn,base,less AUTHOR Parthasarathy Nambi, Apr 12 2008 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 June 25 14:30 EDT 2019. Contains 324352 sequences. (Running on oeis4.)