Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                

Revision History for A295514

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

Showing entries 1-10 | older changes
a(n) = 2^bil(n) - bil(n) where bil(0) = 0 and bil(n) = floor(log_2(n)) + 1 for n > 0.
(history; published version)
#14 by Joerg Arndt at Mon Dec 04 02:55:20 EST 2017
STATUS

proposed

approved

#13 by Jon E. Schoenfield at Sun Dec 03 22:50:26 EST 2017
STATUS

editing

proposed

#12 by Jon E. Schoenfield at Sun Dec 03 22:50:23 EST 2017
NAME

a(n) = 2^bil(n) - bil(n) where bil(0) = 0 and bil(n) = floor(log_2(n)) + 1 for n > 0.

FORMULA

a(n) = 4*a(floor(n/2)) - 5*a(floor(n/4)) + 2*a(floor(n/8)) for n >= 4. (End)

STATUS

proposed

editing

#11 by Robert Israel at Sun Dec 03 21:46:49 EST 2017
STATUS

editing

proposed

#10 by Robert Israel at Sun Dec 03 21:46:42 EST 2017
LINKS

Robert Israel, <a href="/A295514/b295514.txt">Table of n, a(n) for n = 0..10000</a>

FORMULA

From Robert Israel, Dec 03 2017: (Start)

G.f. (1-x)^(-1)*(1+Sum_{k>=0} (2^k-1)*x^(2^k)). - _Robert Israel_, Dec 03 2017

a(n)=4*a(floor(n/2))-5*a(floor(n/4))+2*a(floor(n/8)) for n >= 4. (End)

#9 by Robert Israel at Sun Dec 03 21:37:04 EST 2017
FORMULA

G.f. (1-x)^(-1)*(1+Sum_{k>=0} (2^k-1)*x^(2^k)). - Robert Israel, Dec 03 2017

MAPLE

1, seq((2^k-k)$(2^(k-1)), k=1..8); # Robert Israel, Dec 03 2017

STATUS

approved

editing

#8 by Peter Luschny at Sat Dec 02 10:04:49 EST 2017
STATUS

reviewed

approved

#7 by Joerg Arndt at Sat Dec 02 08:45:53 EST 2017
STATUS

proposed

reviewed

#6 by David A. Corneth at Sat Dec 02 07:10:05 EST 2017
STATUS

editing

proposed

#5 by David A. Corneth at Sat Dec 02 07:09:12 EST 2017
CROSSREFS

Cf. A000325.

STATUS

proposed

editing