OFFSET
1,2
COMMENTS
LINKS
Amiram Eldar, Table of n, a(n) for n = 1..10000
EXAMPLE
MATHEMATICA
s[n_] := s[n] = DigitCount[Fibonacci[n], 2, 1]; Select[Range[2000], s[#] == s[# + 1] &]
PROG
(PARI) isok(k) = hammingweight(fibonacci(k)) == hammingweight(fibonacci(k+1)); \\ Michel Marcus, May 13 2022
(Python)
from itertools import islice
def A353986_gen(): # generator of terms
a, b, k, ah = 1, 1, 1, 1
while True:
if ah == (bh := b.bit_count()):
yield k
a, b, ah = b, a+b, bh
k += 1
CROSSREFS
KEYWORD
nonn,base
AUTHOR
Amiram Eldar, May 13 2022
STATUS
approved