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.

A074375 s(s+3)/2 where s is the sum of the prime factors of n (with repetition).

This page as a plain text file.
%I A074375 #5 Nov 21 2013 12:47:52
%S A074375 0,5,9,14,20,20,35,27,27,35,77,35,104,54,44,44,170,44,209,54,65,104,
%T A074375 299,54,65,135,54,77,464,65,527,65,119,209,90,65,740,252,152,77,902,
%U A074375 90,989,135,77,350,1175,77,119,90,230,170,1484,77,152,104,275,527,1829,90
%N A074375 s(s+3)/2 where s is the sum of the prime factors of n (with repetition).
%H A074375 Neville Holmes, <a href="http://www.comp.utas.edu.au/users/nholmes/sqncs/cmbntns.htm#A074375">Integer Sequence Combinations</a>
%e A074375 a(20) = 9(9+3)/2 = 54 because 9 = 2+2+5 and 20 = 2*2*5.
%t A074375 spf[n_]:=Module[{c=Total[Times@@@FactorInteger[n]]},(c(c+3))/2]; Join[ {0}, Rest[Array[spf,60]]] (* _Harvey P. Dale_, Aug 16 2011 *)
%Y A074375 Applies A000096 to A001414. Cf. A074373, A074374.
%K A074375 easy,nonn
%O A074375 1,2
%A A074375 _W. Neville Holmes_, Aug 29 2002