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 #15 Nov 24 2024 11:27:39
%S 1,1,5,1,19,-19,41,1,41,-17,109,-115,155,-7,47,1,271,-199,341,-161,
%T 141,37,505,-499,469,71,365,-199,811,-1021,929,1,449,163,683,-1159,
%U 1331,221,663,-737,1639,-1659,1805,-251,299,361,2161,-2035,2001,-467,1211,-265,2755,-1819,1927,-967,1545,631,3421,-5293,3659,737
%N Deficiency of squares: a(n) = 2n^2 - sigma(n^2).
%C It is conjectured that 1's occur only when n is two's power (A000079), and that there are no -1's in this sequence. See comments in A033879 and in A337339.
%H Antti Karttunen, <a href="/A377879/b377879.txt">Table of n, a(n) for n = 1..20000</a>
%H <a href="/index/Si#SIGMAN">Index entries for sequences related to sigma(n)</a>.
%F a(n) = A033879(A000290(n)).
%t Table[2n^2-DivisorSigma[1, n^2], {n, 62}] (* _James C. McMahon_, Nov 24 2024 *)
%o (PARI)
%o A033879(n) = (n+n-sigma(n));
%o A377879(n) = A033879(n*n);
%Y Cf. A000290, A000079 (conjectured to give positions of all 1's), A033879, A378231 [= a(A003961(n))].
%Y Cf. A000012, A083884.
%Y Cf. also square array A083064.
%K sign
%O 1,3
%A _Antti Karttunen_, Nov 23 2024