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.

A378182 Sum of row n of A378180.

This page as a plain text file.
%I A378182 #5 Nov 24 2024 09:39:06
%S A378182 0,1,1,3,1,6,1,7,4,8,1,25,1,10,9,15,1,25,1,47,11,14,1,90,6,16,13,77,1,
%T A378182 80,1,31,15,20,13,90,1,22,17,250,1,116,1,161,58,26,1,301,8,47,21,215,
%U A378182 1,90,17,554,23,32,1,490,1,34,90,63,19,212,1,347,27,152
%N A378182 Sum of row n of A378180.
%H A378182 Michael De Vlieger, <a href="/A378182/b378182.txt">Table of n, a(n) for n = 1..10000</a>
%F A378182 a(n) = A376567(n) - A377071(n).
%F A378182 For prime p, a(p) = 1.
%F A378182 For prime power p^k, a(p^k) = A244974(p^k)-p^k = A000203(p^k)-p^k.
%F A378182 a(2^k) = 2^k - 1.
%F A378182 For n in A024619, a(n) != A244974(n).
%t A378182 rad[x_] := rad[x] = Times @@ FactorInteger[x][[All, 1]];
%t A378182 Block[{k}, Table[k = PrimeOmega[n];
%t A378182   Total@ Select[Range[n^PrimeNu[n]],
%t A378182     Divisible[n, rad[#]] && PrimeOmega[#] < k &], {n, 60}]]
%Y A378182 Cf. A000203, A007947, A024619, A244974, A376567, A377071, A378180.
%K A378182 nonn,easy
%O A378182 1,4
%A A378182 _Michael De Vlieger_, Nov 20 2024