login

Revision History for A062050

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

Showing entries 1-10 | older changes
n-th chunk consists of the numbers 1, ..., 2^n.
(history; published version)
#91 by Michel Marcus at Tue Jan 07 05:44:39 EST 2025
STATUS

reviewed

approved

#90 by Stefano Spezia at Tue Jan 07 04:05:57 EST 2025
STATUS

proposed

reviewed

#89 by Jason Yuen at Tue Jan 07 04:02:57 EST 2025
STATUS

editing

proposed

#88 by Jason Yuen at Tue Jan 07 04:02:26 EST 2025
PROG

(PARI) a(n)=floor(n+1-2^floor(loglogint(n+1-10^-27)/log(, 2)))

KEYWORD

nonn,easy,changed

#87 by Jason Yuen at Tue Jan 07 03:59:30 EST 2025
FORMULA

Without the constant 1, Ralf Stephan's g.f. becomes A(x) = x/(1-x)^2 - (1/(1-x)) * Sum_{k>=1} 2^(k-1)*x^(2^k)) and satisfies the functional equation A(x) - 2*(1+x)*A(x^2) = x*(1 - x - x^2)/(1 - x^2). - Petros Hadjicostas, Apr 27 2020

STATUS

approved

editing

#86 by Michael De Vlieger at Fri Dec 13 21:46:35 EST 2024
STATUS

reviewed

approved

#85 by Andrew Howroyd at Fri Dec 13 18:58:01 EST 2024
STATUS

proposed

reviewed

#84 by Ruud H.G. van Tol at Fri Dec 13 18:13:44 EST 2024
STATUS

editing

proposed

#83 by Ruud H.G. van Tol at Fri Dec 13 18:13:36 EST 2024
PROG

(PARI) a(n)= n - 1<<logint(n, 2) + 1; \\ Ruud H.G. van Tol, Dec 13 2024

STATUS

approved

editing

#82 by Joerg Arndt at Mon Jan 23 02:32:52 EST 2023
STATUS

reviewed

approved