|
%I #9 May 13 2013 01:54:11
%S 4,2,4,2,2,4,4,2,2,2,2,4,5,2,4,2,2,2,2,2,2,3,2,4,2,4,5,5,2,4,4,2,2,2,
%T 2,2,2,2,2,2,4,2,2,2,3,2,2,4,3,2,2,5,4,5,3,2,5,2,3,4,3,2,4,2,2,2,2,2,
%U 2,4,2,2,2,2,2,2,2,2,4,2,2,3,4,2,2,2,2,4,2,3,3,2,3,2,2,4,3,2,3,2,2,2,3,2,5
%N a(n) is the least positive integer m such that (A001969(n))^m is in A000069.
%C Conjecture: a(n) exists for all n >= 2.
%C The values of A001969(n)^m are given in A178373. [From _Jeremy Gardiner_, May 26 2010]
%H Charles R Greathouse IV, <a href="/A178253/b178253.txt">Table of n, a(n) for n = 2..10000</a>
%F If k=A001969(n)=2^m*A001969(s), where A001969(s) is odd, then a(n)=a(s).
%o (PARI) a(n)=my(e=2*n--+hammingweight(n)%2,m=1); e>>=valuation(e,2); while(hammingweight(e^m++)%2==0,);m \\ _Charles R Greathouse IV_, Mar 22 2013
%Y Cf. A000069, A001969, A178373.
%K nonn,easy
%O 2,1
%A _Vladimir Shevelev_, May 24 2010, May 25 2010
%E Extended by _Jeremy Gardiner_, May 26 2010
%E Edited by _N. J. A. Sloane_, Jun 08 2010
|
