STATUS
reviewed
approved
reviewed
approved
proposed
reviewed
editing
proposed
1,
1, 2,
1, 2, 3, 3,
1, 2, 3, 3, 4, 5, 4, 5,
1, 2, 3, 3, 4, 5, 4, 5, 5, 7, 7, 8, 5, 7, 7, 8,
1, 2, 3, 3, 4, 5, 4, 5, 5, 7, 7, 8, 5, 7, 7, 8, 6, 9, 10, 11, 9, 12, 11, 13, 6, 9,
proposed
editing
editing
proposed
(PARI) a(n) = if(n==0, 1, my(x=1, y=1); for(i=0, logint(n, 2), if(bittest(n, i), [x, y]=[x+y, x], [x, y]=[x, x+y])); y) \\ Mikhail Kurkov, Mar 10 2023 [verification needed]
approved
editing
proposed
approved
editing
proposed
(PARI) a(n) = if(n==0, 1, my(x=1, y=1); for(i=0, logint(n, 2), if(bittest(n, i), [x, y]=[x+y, x], [x, y]=[x, x+y])); y) \\ Mikhail Kurkov, Mar 10 2023 [verification needed]
approved
editing
reviewed
approved