%I A069782
%S A069782 1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26,
%T A069782 27,28,29,30,31,32,33,34,35,36,37,38,39,40,41,42,43,44,45,46,47,48,49,
%U A069782 50,51,52,53,54,55,56,57,58,59,60,61,62,63,64,65,66,67,68,69
%N A069782 Numbers n such that g[n] := GCD[d[n^3],d[n]] = 2^w for some w. The first 
               missing integer is 432 (See in A069781).
%H A069782 Tanya Khovanova, <a href="http://www.tanyakhovanova.com/RecursiveSequences/
               NonRecursions.html">Non Recursions</a>
%e A069782 Below 100000 only 314 integers are missing, collected in A069781.
%t A069782 f[x_] := GCD[DivisorSigma[0, x^3], DivisorSigma[0, x]]; Do[s=f[n]; If[IntegerQ[Log[2, 
               s]], Print[{n, s}]], {n, 1, 100000}]
%Y A069782 Cf. A000005, A069780, A069781, A037992, A061701.
%Y A069782 Sequence in context: A160356 A038608 A105811 this_sequence A088480 A061019 
               A028310
%Y A069782 Adjacent sequences: A069779 A069780 A069781 this_sequence A069783 A069784 
               A069785
%K A069782 nonn
%O A069782 1,2
%A A069782 Labos E. (labos(AT)ana.sote.hu), Apr 08 2002