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.

A129319 a(n) = sopfr(A129317(n)), where sopfr(x) is the sum of the prime factors of x, counting multiplicity.

This page as a plain text file.
%I A129319 #10 Oct 26 2019 09:58:04
%S A129319 5,6,8,18,15,30,34,78,29,86,115,525,50,110,33,204,286,62,506,32,185,
%T A129319 120,35,92,180,100,390,102,624,450,44,198,455,180,294,306,45,141,882,
%U A129319 134,650,86,708,575,116,75,150,174,152,375,160,286,242,122,584,518,1456,448
%N A129319 a(n) = sopfr(A129317(n)), where sopfr(x) is the sum of the prime factors of x, counting multiplicity.
%H A129319 Amiram Eldar, <a href="/A129319/b129319.txt">Table of n, a(n) for n = 1..10000</a>
%e A129319 a(6)=30 since sopfr(A129317(6))=sopfr(161)=sopfr(7*23)=30.
%Y A129319 Cf. A001414, A006145, A039752, A129316, A129317, A129318, A129320.
%K A129319 easy,nonn
%O A129319 1,1
%A A129319 _Walter Kehowski_, Apr 09 2007