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.

A345270 a(n) = Sum_{d|n} d^tau(n/d).

This page as a plain text file.
%I A345270 #14 Jun 09 2023 22:38:09
%S A345270 1,3,4,9,6,20,8,33,19,40,12,108,14,68,50,161,18,225,20,278,80,148,24,
%T A345270 850,51,200,136,600,30,1114,32,1089,164,328,110,3387,38,404,218,2450,
%U A345270 42,3214,44,1892,558,580,48,12596,99,1409,350,2958,54,8630,202,6370,428,904,60,33042
%N A345270 a(n) = Sum_{d|n} d^tau(n/d).
%C A345270 If p is a prime, a(p) = Sum_{d|p} d^tau(p/d) = 1^2 + p^1 = p + 1.
%H A345270 Seiichi Manyama, <a href="/A345270/b345270.txt">Table of n, a(n) for n = 1..10000</a>
%F A345270 a(n) = Sum_{d|n} (n/d)^tau(d). - _Wesley Ivan Hurt_, Jun 09 2023
%e A345270 a(10) = Sum_{d|10} d^tau(10/d) = 1^4 + 2^2 + 5^2 + 10^1 = 40.
%t A345270 Table[Sum[k^DivisorSigma[0, n/k] (1 - Ceiling[n/k] + Floor[n/k]), {k, n}], {n, 60}]
%o A345270 (PARI) a(n) = sumdiv(n, d, d^numdiv(n/d)); \\ _Michel Marcus_, Oct 08 2021
%Y A345270 Cf. A000005 (tau), A174937, A345271.
%K A345270 nonn
%O A345270 1,2
%A A345270 _Wesley Ivan Hurt_, Jun 12 2021