OFFSET
1,1
COMMENTS
It is obvious that these numbers must contain an even number of digits.
This sequence is probably finite. The equivalent sequences in bases 4, 6, and 8 are probably infinite. - Franklin T. Adams-Watters, Aug 06 2009
LINKS
Simon Plouffe, Project Gutenberg
EXAMPLE
24157817 is a Fibonacci number containing equal numbers of prime digits (2,5,7,7) and nonprime digits (4,1,8,1).
MATHEMATICA
pnpQ[n_]:=Module[{idn=IntegerDigits[n], len}, len=Length[idn]; EvenQ[len] && Count[idn, _?PrimeQ]==len/2]; Select[Fibonacci[Range[250]], pnpQ] (* Harvey P. Dale, May 01 2012 *)
PROG
(PARI) (mydigits(n, b=10)=local(r); r=[]; while(n>0, r=concat([n%b], r); n\=b); r); for(n=1, 500, v=mydigits(fibonacci(n)); np=sum(i=1, #v, isprime(v[i])); if(#v==2*np, print1(fibonacci(n)", ")))
CROSSREFS
KEYWORD
nonn,base
AUTHOR
Parthasarathy Nambi, Jul 21 2009
EXTENSIONS
Edited and extended by Franklin T. Adams-Watters, Aug 06 2009
STATUS
approved