|
%I #10 Apr 02 2015 10:22:24
%S 1,1,0,0,1,0,0,1,0,0,1,1,1,0,0,0,1,0,1,0,0,0,1,1,1,0,0,1,1,0,0,0,1,1,
%T 1,1,2,1,1,1,2,0,2,1,1,0,1,0,1,1,1,1,2,0,0,1,1,0,1,1,1,0,0,0,1,1,1,0,
%U 1,1,1,0,2,1,0,1,1,0,1,1,1,1,2,0,0,0,0,1,2,0,0,1,0,0,0,1,1,1,1,1,2,0,1,1,0
%N a(n) = the number of times the binary representation of the number of divisors of n occurs in the binary representation of n.
%H Harvey P. Dale, <a href="/A143262/b143262.txt">Table of n, a(n) for n = 1..1000</a>
%e 37 has 2 divisors. 37 in binary is 100101. 2 in binary is 10. 10 occurs in two places in 100101: (10)0(10)1. So a(37) = 2.
%t Table[SequenceCount[IntegerDigits[n,2],IntegerDigits[DivisorSigma[0,n],2]],{n,110}] (* The program uses the SequenceCount function from Mathematica version 10.1 *) (* _Harvey P. Dale_, Apr 02 2015 *)
%Y Cf. A143263, A143264.
%K base,nonn
%O 1,37
%A _Leroy Quet_, Aug 03 2008
%E Extended by _Ray Chandler_, Nov 09 2008
|
