The On-Line Encyclopedia of Integer Sequences (OEIS)

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

A066323

Number of one bits in binary representation of base i-1 expansion of n (where i = sqrt(-1)).
(history; published version)

#32 by Joerg Arndt at Mon Mar 22 05:47:23 EDT 2021

STATUS

reviewed

approved

#31 by Michel Marcus at Mon Mar 22 03:20:10 EDT 2021

STATUS

proposed

reviewed

#30 by Amiram Eldar at Mon Mar 22 03:14:36 EDT 2021

STATUS

editing

proposed

#29 by Amiram Eldar at Mon Mar 22 03:03:06 EDT 2021

MATHEMATICA

a[n_] := Plus @@ Mod[NestWhileList[(# - Mod[#, 4])/-4 &, n, # != 0 &], 4]; Array[a, 100, 0] (* Amiram Eldar, Mar 22 2021 *)

STATUS

approved

editing

#28 by Michel Marcus at Sun Mar 21 13:11:45 EDT 2021

STATUS

reviewed

approved

#27 by Joerg Arndt at Sun Mar 21 13:07:22 EDT 2021

STATUS

proposed

reviewed

#26 by Jon E. Schoenfield at Sun Mar 21 08:53:20 EDT 2021

STATUS

editing

proposed

#25 by Jon E. Schoenfield at Sun Mar 21 08:53:16 EDT 2021

REFERENCES

D. E. Knuth, The Art of Computer Programming. Addison-Wesley, Reading, MA, 1969, Vol. 2, p. 172, . (Also exercise 16, p. 177, answer, p. 494.)

STATUS

reviewed

editing

#24 by Michel Marcus at Sun Mar 21 04:58:05 EDT 2021

STATUS

proposed

reviewed

#23 by David A. Corneth at Sat Mar 20 11:09:03 EDT 2021

STATUS

editing

proposed