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.

A350996 a(n) = Sum_{k=1..n} k * rad(k).

This page as a plain text file.
%I A350996 #18 Dec 09 2023 07:08:08
%S A350996 1,5,14,22,47,83,132,148,175,275,396,468,637,833,1058,1090,1379,1487,
%T A350996 1848,2048,2489,2973,3502,3646,3771,4447,4528,4920,5761,6661,7622,
%U A350996 7686,8775,9931,11156,11372,12741,14185,15706,16106,17787,19551,21400,22368,23043,25159
%N A350996 a(n) = Sum_{k=1..n} k * rad(k).
%H A350996 Amiram Eldar, <a href="/A350996/b350996.txt">Table of n, a(n) for n = 1..10000</a>
%H A350996 Wikipedia, <a href="https://en.wikipedia.org/wiki/Radical_of_an_integer">Radical of an integer</a>.
%F A350996 a(n) = Sum_{k=1..n} A064549(k).
%F A350996 a(n) ~ c * n^3 / 3, where c = A065463. - _Amiram Eldar_, Dec 09 2023
%e A350996 a(4) = 22; a(4) = Sum_{k=1..4} k * rad(k) = 1*rad(1) + 2*rad(2) + 3*rad(3) + 4*rad(4) = 1*1 + 2*2 + 3*3 + 4*2 = 22.
%t A350996 f[n_] := n * Times @@ FactorInteger[n][[;; , 1]]; Accumulate @ Array[f, 50] (* _Amiram Eldar_, Jan 29 2022 *)
%o A350996 (PARI) a(n) = sum(k=1, n, k*factorback(factorint(k)[, 1])); \\ _Michel Marcus_, Jan 30 2022
%Y A350996 Cf. A007947 (rad), A073355, A064549, A065463.
%K A350996 nonn
%O A350996 1,2
%A A350996 _Wesley Ivan Hurt_, Jan 28 2022