cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A344765 a(n) = sigma(n) - A011772(n).

This page as a plain text file.
%I A344765 #19 Jun 12 2021 06:05:37
%S A344765 0,0,2,0,2,9,2,0,5,14,2,20,2,17,19,0,2,31,2,27,26,25,2,45,7,30,14,49,
%T A344765 2,57,2,0,37,38,34,83,2,41,44,75,2,76,2,52,69,49,2,92,9,69,55,59,2,93,
%U A344765 62,72,62,62,2,153,2,65,77,0,59,133,2,110,73,124,2,132,2,78,100,84,75,156,2,122,41,86,2,176,74,89
%N A344765 a(n) = sigma(n) - A011772(n).
%H A344765 Antti Karttunen, <a href="/A344765/b344765.txt">Table of n, a(n) for n = 1..16384</a>
%H A344765 Antti Karttunen, <a href="/A344765/a344765.txt">Data supplement: n, a(n) computed for n = 1..65537</a>
%H A344765 <a href="/index/Si#SIGMAN">Index entries for sequences related to sigma(n)</a>
%F A344765 a(n) = A000203(n) - A011772(n).
%F A344765 a(n) = A001065(n) + A344763(n).
%F A344765 a(n) = Sum_{d|n} A344768(d).
%F A344765 a(n) = A344769(n) - A294898(n).
%t A344765 A011772[n_] := Module[{m = 1}, While[Not[IntegerQ[m(m+1)/(2n)]], m++]; m];
%t A344765 a[n_] := DivisorSigma[1, n] - A011772[n];
%t A344765 Array[a, 100] (* _Jean-François Alcover_, Jun 12 2021 *)
%o A344765 (PARI) A344765(n) = (sigma(n) - A011772(n));
%Y A344765 Cf. A000203, A001065, A011772, A294898, A344763, A344766, A344768 (Möbius transform), A344769.
%K A344765 nonn
%O A344765 1,3
%A A344765 _Antti Karttunen_, May 30 2021