

A082922


Numbers n such that when the digits of Fibonacci(n) are sorted into decreasing order and zeros are dropped it is a prime.


0



3, 4, 5, 7, 9, 14, 15, 27, 29, 31, 42, 59, 70, 71, 78, 103, 135, 141, 202, 203, 231, 305, 395, 431, 458, 481, 522, 617, 874, 978, 1161, 1535, 2293, 2445, 2597, 2727, 3146, 3701, 3705, 4746, 5415, 5821, 5969, 6193, 6305, 6557, 7449, 7897, 8423, 10479
(list;
graph;
refs;
listen;
history;
text;
internal format)



OFFSET

1,1


COMMENTS

Larger values not certified prime.


LINKS

Table of n, a(n) for n=1..50.


EXAMPLE

a(8) = 27 because Fibonacci(27) = 196418 and 986411 is prime.


MATHEMATICA

Do[ k = Sort[ IntegerDigits[ Fibonacci[n]]]; While[ k[[1]] == 0, k = Drop[k, 1]]; If[ PrimeQ[ FromDigits[ Reverse[ k]]], Print[n]], {n, 1, 10540}]


CROSSREFS

Sequence in context: A164572 A067530 A259796 * A036971 A000702 A067526
Adjacent sequences: A082919 A082920 A082921 * A082923 A082924 A082925


KEYWORD

base,nonn


AUTHOR

Jason Earls, May 25 2003


EXTENSIONS

Edited and extended by Robert G. Wilson v, May 26 2003


STATUS

approved



