Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #20 Aug 27 2017 12:55:24
%S 1,0,0,1,0,0,0,0,1,0,0,0,0,0,0,1,0,1,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,
%T 0,1,0,0,0,0,0,0,0,0,0,0,0,1,1,1,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,
%U 0,0,0,0,0,0,1,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,2,0,0,0,0,0
%N a(n) is the number of ways to write n = k^2 * j, j <= k, gcd(k,j) = 1, where j and k are positive integers.
%C Sum_{n>0} a(n)/n = 2.
%H Antti Karttunen, <a href="/A102448/b102448.txt">Table of n, a(n) for n = 1..65537</a>
%F a(n) <= A102354(n). - _Antti Karttunen_, Aug 27 2017
%e a(18) = 1 because 18 = k^2 * j, j <= k, gcd(k,j)=1, in one way: k=3, j=2.
%t t = Sort[ Flatten[ Table[ If[ GCD[j, k] == 1, k^2*j, {}], {k, 11}, {j, k}]]]; Table[ Count[t, n], {n, 105}] (* _Robert G. Wilson v_, Feb 25 2005 *)
%o (PARI) A102448(n) = sumdiv(n,d,((1==gcd(d,(n/d))) && issquare(d) && (sqrtint(d) >= (n/d)))); \\ _Antti Karttunen_, Aug 27 2017
%Y Cf. A102354, A104021, A104023, A104025.
%K nonn
%O 1,100
%A _Leroy Quet_, Feb 23 2005
%E More terms from _Robert G. Wilson v_, Feb 24 2005