cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A192085 Number of ones in the binary expansion of n^3.

This page as a plain text file.
%I A192085 #23 May 22 2025 10:21:35
%S A192085 0,1,1,4,1,6,4,6,1,6,6,6,4,5,6,8,1,6,6,8,6,6,6,9,4,7,5,8,6,9,8,10,1,6,
%T A192085 6,11,6,10,8,12,6,8,6,9,6,11,9,10,4,9,7,7,5,8,8,10,6,10,9,7,8,11,10,
%U A192085 12,1,6,6,11,6,9,11,11,6,13,10,14,8,13,12,13
%N A192085 Number of ones in the binary expansion of n^3.
%C A192085 The binary weight of n^3.
%H A192085 Nathaniel Johnston, <a href="/A192085/b192085.txt">Table of n, a(n) for n = 0..10000</a>
%H A192085 <a href="/index/Bi#binary">Index entries for sequences related to binary expansion of n</a>
%F A192085 a(n) = A000120(A000578(n)).
%F A192085 a(n) = [x^(n^3)] (1/(1 - x))*Sum_{k>=0} x^(2^k)/(1 + x^(2^k)). - _Ilya Gutkovskiy_, Mar 27 2018
%p A192085 A192085 := proc(n) return add(b,b=convert(n^3,base,2)): end: seq(A192085(n),n=0..100); # _Nathaniel Johnston_, Jun 23 2011
%o A192085 (Magma) [&+Intseq(n^3,2): n in [0..79]];  // _Bruno Berselli_, Jun 24 2011
%o A192085 (Python)
%o A192085 def A192085(n):
%o A192085     return bin(n**3).count('1') # _Chai Wah Wu_, Sep 03 2014
%o A192085 (PARI) a(n)=hammingweight(n^3) \\ _Charles R Greathouse IV_, Sep 27 2016
%Y A192085 Cf. A000120, A000578, A007088, A159918.
%K A192085 nonn,base,easy
%O A192085 0,4
%A A192085 _Carl R. White_, Jun 23 2011