The On-Line Encyclopedia of Integer Sequences (OEIS)

The OEIS is supported by the many generous donors to the OEIS Foundation.

Revision History for A062756

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

A062756

Number of 1's in ternary (base-3) expansion of n.
(history; published version)

#63 by Michael De Vlieger at Sun Dec 10 11:10:27 EST 2023

STATUS

reviewed

approved

#62 by Stefano Spezia at Sun Dec 10 10:46:19 EST 2023

STATUS

proposed

reviewed

#61 by Ruud H.G. van Tol at Sun Dec 10 10:17:45 EST 2023

STATUS

editing

proposed

#60 by Ruud H.G. van Tol at Sun Dec 10 10:17:19 EST 2023

PROG

(PARI) a(n)=hammingweight(digits(n, 3)%2); \\ Ruud H.G. van Tol, Dec 10 2023

STATUS

approved

editing

#59 by Joerg Arndt at Sat Dec 24 03:39:48 EST 2022

STATUS

reviewed

approved

#58 by Michel Marcus at Sat Dec 24 03:24:48 EST 2022

STATUS

proposed

reviewed

#57 by Michel Marcus at Sat Dec 24 03:24:45 EST 2022

STATUS

editing

proposed

#56 by Michel Marcus at Sat Dec 24 03:24:41 EST 2022

LINKS

R. Reinhard Zumkeller, <a href="/A062756/b062756.txt">Table of n, a(n) for n = 0..10000</a>

STATUS

proposed

editing

#55 by Chai Wah Wu at Fri Dec 23 18:18:50 EST 2022

STATUS

editing

proposed

#54 by Chai Wah Wu at Fri Dec 23 18:18:48 EST 2022

PROG

(Python)

from sympy.ntheory import digits

def A062756(n): return digits(n, 3)[1:].count(1) # Chai Wah Wu, Dec 23 2022

STATUS

approved

editing