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

Revision History for A143146

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

Showing entries 1-10 | older changes
a(n) is the smallest positive multiple of n that has the same number of 0's as 1's in its binary representation.
(history; published version)
#24 by Alois P. Heinz at Mon Jul 11 16:05:10 EDT 2022
STATUS

reviewed

approved

#23 by Michel Marcus at Mon Jul 11 12:54:35 EDT 2022
STATUS

proposed

reviewed

#22 by Rémy Sigrist at Mon Jul 11 12:40:22 EDT 2022
STATUS

editing

proposed

#21 by Rémy Sigrist at Mon Jul 11 12:12:55 EDT 2022
FORMULA

a(n) = n * A351599(n). - Rémy Sigrist, Jul 11 2022

CROSSREFS
STATUS

approved

editing

Discussion
Mon Jul 11
12:40
Rémy Sigrist: added formula / xref
#20 by OEIS Server at Mon May 16 02:01:58 EDT 2022
LINKS

Michael S. Branicky, <a href="/A143146/b143146_1.txt">Table of n, a(n) for n = 1..10000</a> (terms 1..1000 from Harvey P. Dale)

#19 by Joerg Arndt at Mon May 16 02:01:58 EDT 2022
STATUS

reviewed

approved

Discussion
Mon May 16
02:01
OEIS Server: Installed new b-file as b143146.txt.  Old b-file is now b143146_1.txt.
#18 by Michel Marcus at Mon May 16 00:37:03 EDT 2022
STATUS

proposed

reviewed

#17 by Michael S. Branicky at Sun May 15 21:26:12 EDT 2022
STATUS

editing

proposed

#16 by Michael S. Branicky at Sun May 15 21:26:10 EDT 2022
LINKS

Harvey PMichael S. Dale, Branicky, <a href="/A143146/b143146_1.txt">Table of n, a(n) for n = 1..10000</a> (terms 1..1000</a> from Harvey P. Dale)

PROG

(Python)

def a(n):

m = n

b = bin(m)[2:]

while len(b) != 2*b.count("1"):

m += n

b = bin(m)[2:]

return m

print([a(n) for n in range(1, 61)]) # Michael S. Branicky, May 15 2022

STATUS

approved

editing

#15 by Joerg Arndt at Mon Mar 11 03:04:30 EDT 2019
STATUS

reviewed

approved