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.

A351711 a(n) = Sum_{p|n, p prime} Sum_{d|n} gcd(d,p).

This page as a plain text file.
%I A351711 #16 Dec 06 2022 03:22:15
%S A351711 0,3,4,5,6,14,8,7,7,18,12,22,14,22,20,9,18,23,20,28,24,30,24,30,11,34,
%T A351711 10,34,30,52,32,11,32,42,28,36,38,46,36,38,42,60,44,46,32,54,48,38,15,
%U A351711 31,44,52,54,32,36,46,48,66,60,80,62,70,38,13,40,76,68,64,56,68,72,49
%N A351711 a(n) = Sum_{p|n, p prime} Sum_{d|n} gcd(d,p).
%H A351711 Robert Israel, <a href="/A351711/b351711.txt">Table of n, a(n) for n = 1..10000</a>
%F A351711 a(p) = p + 1, p prime.
%F A351711 a(n) = tau(n)*omega(n) + Sum_{p|n, p prime} (p-1)*tau(n/p).
%e A351711 a(6) = 14; a(6) = Sum_{p|6, p prime} Sum_{d|6} gcd(d,p) = gcd(1,2) + gcd(2,2) + gcd(3,2) + gcd(6,2) + gcd(1,3) + gcd(2,3) + gcd(3,3) + gcd(6,3) = 1 + 2 + 1 + 2 + 1 + 1 + 3 + 3 = 14.
%p A351711 f:= proc(n) local p, P; uses numtheory;
%p A351711   P:= factorset(n);
%p A351711   tau(n)*nops(P)+add((p-1)*tau(n/p),p=P);
%p A351711 end proc:
%p A351711 map(f, [$1..100]); # _Robert Israel_, Dec 05 2022
%o A351711 (PARI) a(n) = my(f=factor(n)); sum(k=1, #f~, (f[k,1]-1)*numdiv(n/f[k,1])) + omega(f)*numdiv(f); \\ _Michel Marcus_, Feb 18 2022
%Y A351711 Cf. A001221 (omega), A000005 (tau), A351758.
%K A351711 nonn,look
%O A351711 1,2
%A A351711 _Wesley Ivan Hurt_, Feb 16 2022