The On-Line Encyclopedia of Integer Sequences (OEIS)

Revision History for A101925 (Bold, blue-underlined text is an addition; faded, red-underlined text is a ~~deletion~~.)
Showing entries 1-10 | older changes

A101925

a(n) = A005187(n) + 1.
(history; published version)

#34 by Charles R Greathouse IV at Thu Dec 29 07:06:48 EST 2022

STATUS

editing

approved

#33 by Charles R Greathouse IV at Thu Dec 29 07:06:09 EST 2022

PROG

(PARI) a(n)=2*n+1-hammingweight(n) \\ Charles R Greathouse IV, Dec 29 2022

STATUS

approved

editing

#32 by Peter Luschny at Wed Jul 13 09:34:14 EDT 2022

STATUS

reviewed

approved

#31 by Joerg Arndt at Wed Jul 13 09:28:40 EDT 2022

STATUS

proposed

reviewed

#30 by Chai Wah Wu at Wed Jul 13 09:12:57 EDT 2022

STATUS

editing

proposed

#29 by Chai Wah Wu at Wed Jul 13 09:12:54 EDT 2022

PROG

(Python 3.10+)

def A101925(n): return (n<<1)-n.bit_count()+1 # Chai Wah Wu, Jul 13 2022

STATUS

approved

editing

#28 by N. J. A. Sloane at Sun Feb 05 13:41:20 EST 2017

STATUS

reviewed

approved

#27 by Joerg Arndt at Sun Feb 05 03:46:44 EST 2017

STATUS

proposed

reviewed

#26 by Wesley Ivan Hurt at Sat Feb 04 14:53:03 EST 2017

STATUS

editing

proposed

#25 by Wesley Ivan Hurt at Sat Feb 04 14:52:13 EST 2017

FORMULA

G.f.: (1 / 1-z) * (z + z * sum(z^(2^i) * (s + (1 / (1 - z^(2^k)))),i=0..infinity)) . - Frank Ruskey and Chris Deugau (deugaucj(AT)uvic.ca)

CROSSREFS

Cf. A000120, A005187, A046699.

Cf. A032184, A052278, A060055, A066318, A088229, A101926.

STATUS

proposed

editing