OFFSET
1,1
LINKS
Amiram Eldar, Table of n, a(n) for n = 1..10000 (terms 1..656 from Indranil Ghosh)
Antti Karttunen and John Moyer, C-program for computing the initial terms of this sequence.
MATHEMATICA
Select[Flatten[Position[Mod[DigitCount[Select[Range[0, 5000], BitAnd[#, 2 #] == 0 &], 2, 1], 2], 1]] - 1, PrimeQ] (* Amiram Eldar, Feb 07 2023 *)
PROG
(Python)
from sympy import fibonacci, primerange
def a(n):
k=0
x=0
while n>0:
k=0
while fibonacci(k)<=n: k+=1
x+=10**(k - 3)
n-=fibonacci(k - 1)
return x
def ok(n): return str(a(n)).count("1")%2
print([n for n in primerange(1, 1001) if ok(n)]) # Indranil Ghosh, Jun 08 2017
CROSSREFS
KEYWORD
nonn
AUTHOR
Antti Karttunen, Jun 01 2004
STATUS
approved