A242334 Primes with property that when their binary representation is reversed we obtain a Fibonacci number.

2, 3, 5, 11, 59, 151, 317, 5441, 18427, 9033691613, 12756420479903, 1211140566276649, 401010813707734082716979, 74347828543021309956757002467819, 16538021251556158042076145869636347596983087

Offset

1,1

Links

Hiroaki Yamanouchi, Table of n, a(n) for n = 1..21

Example

a(1) = 2 because reverse(10b) = 01b = 1 = F(1).
a(6) = 151 because reverse(10010111b) = 11101001b = 233 = F(14).

Prog

(Python)
from sympy import isprime
def dec_to_bin(x):
    return (bin(x)[2:])
fib = [1, 1]
for i in range(300):
    fib.append(fib[-1] + fib[-2])
for a in fib[3:]:
    b = dec_to_bin(a)
    c = b[::-1]
    d = int(c, 2)
    if isprime(d) and c[0] != '0':
        print(d, end=', ')
# David Consiglio, Jr., May 16 2014

Crossrefs

Cf. A000040, A000045.

Sequence in context: A114895 A083685 A243755 * A087524 A088053 A050444

Adjacent sequences: A242331 A242332 A242333 * A242335 A242336 A242337

Keyword

nonn,base

Author

Gil Broussard, May 15 2014

Extensions

a(10)-a(12) by David Consiglio, Jr., May 16 2014

a(13)-a(15) from Hiroaki Yamanouchi, Aug 24 2014

Status

approved