login

Revision History for A071766

(Bold, blue-underlined text is an addition; faded, red-underlined text is a deletion.)

Showing entries 1-10 | older changes
Denominator of the continued fraction expansion whose terms are the first-order differences of exponents in the binary representation of 4n, with the exponents of 2 being listed in descending order.
(history; published version)
#68 by Peter Luschny at Wed Apr 24 04:14:24 EDT 2024
STATUS

reviewed

approved

#67 by Joerg Arndt at Wed Apr 24 03:50:36 EDT 2024
STATUS

proposed

reviewed

#66 by Michel Marcus at Wed Apr 24 02:40:33 EDT 2024
STATUS

editing

proposed

#65 by Michel Marcus at Wed Apr 24 02:40:21 EDT 2024
COMMENTS

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,

STATUS

proposed

editing

#64 by Mikhail Kurkov at Wed Apr 24 02:36:59 EDT 2024
STATUS

editing

proposed

#63 by Mikhail Kurkov at Wed Apr 24 02:36:19 EDT 2024
PROG

(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]

STATUS

approved

editing

Discussion
Wed Apr 24
02:36
Mikhail Kurkov: Program is based on a conjecture.
#62 by Michael De Vlieger at Sun Apr 21 21:15:03 EDT 2024
STATUS

proposed

approved

#61 by Jon E. Schoenfield at Sun Apr 21 21:14:09 EDT 2024
STATUS

editing

proposed

#60 by Jon E. Schoenfield at Sun Apr 21 21:13:36 EDT 2024
PROG

(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]

STATUS

approved

editing

#59 by Michael De Vlieger at Fri Mar 10 16:35:23 EST 2023
STATUS

reviewed

approved