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.

A133477 Sum of cubefree divisors of n excluding 1.

This page as a plain text file.
%I A133477 #16 Jul 09 2022 11:09:06
%S A133477 0,2,3,6,5,11,7,6,12,17,11,27,13,23,23,6,17,38,19,41,31,35,23,27,30,
%T A133477 41,12,55,29,71,31,6,47,53,47,90,37,59,55,41,41,95,43,83,77,71,47,27,
%U A133477 56,92,71,97,53,38,71,55,79,89,59,167,61,95,103,6,83,143,67,125,95,143,71,90
%N A133477 Sum of cubefree divisors of n excluding 1.
%H A133477 Harvey P. Dale, <a href="/A133477/b133477.txt">Table of n, a(n) for n = 1..1000</a>
%F A133477 a(n) = A073185(n) - 1. - _N. J. A. Sloane_, Nov 30 2007
%e A133477 a(8) = 6 because the divisors of 8 are {1,2,4,8}, the cubefree divisors are 1, 2, 4 so we get a(8) = 2 + 4 = 6.
%t A133477 scfd[n_]:=Total[Select[Divisors[n],Max[Transpose[FactorInteger[#]][[2]]]<3&]]; Array[scfd,80]-1 (* _Harvey P. Dale_, Nov 30 2014 *)
%t A133477 f[p_, e_] := 1 + p + If[e > 1, p^2, 0]; a[1] = 0; a[n_] := -1 + Times @@ f @@@ FactorInteger[n]; Array[a, 100] (* _Amiram Eldar_, Jul 09 2022 *)
%Y A133477 Cf. A004709, A005117, A039653, A048250, A068318, A083681.
%Y A133477 Cf. A073184, A073185.
%K A133477 easy,nonn
%O A133477 1,2
%A A133477 _Jonathan Vos Post_, Nov 29 2007
%E A133477 Edited by _N. J. A. Sloane_, Nov 30 2007