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.

A341997 a(n) = A327936(A003415(n)).

This page as a plain text file.
%I A341997 #8 Mar 01 2021 17:55:08
%S A341997 1,1,2,1,1,1,2,1,1,1,2,1,1,2,2,1,1,1,2,1,1,1,2,1,1,3,2,1,1,1,2,1,1,2,
%T A341997 2,1,1,2,2,1,1,1,2,1,1,1,2,1,1,2,2,1,3,2,2,1,1,1,2,1,1,1,2,1,1,1,2,1,
%U A341997 1,1,2,1,1,1,2,1,1,1,2,6,1,1,2,1,1,2,2,1,1,2,2,1,1,2,2,1,1,1,2,1,1,1,2,1,1,1,6,1,1,2,2,1,1,2,2,1,1,2,2
%N A341997 a(n) = A327936(A003415(n)).
%H A341997 Antti Karttunen, <a href="/A341997/b341997.txt">Table of n, a(n) for n = 2..65539</a>
%F A341997 a(n) = A327936(A003415(n)).
%o A341997 (PARI)
%o A341997 A003415(n) = {my(fac); if(n<1, 0, fac=factor(n); sum(i=1, matsize(fac)[1], n*fac[i, 2]/fac[i, 1]))}; \\ From A003415
%o A341997 A327936(n) = { my(f = factor(n)); for(k=1, #f~, f[k,2] = (f[k,2]>=f[k,1])); factorback(f); };
%o A341997 A341997(n) = if(n<=1,1,A327936(A003415(n)));
%Y A341997 Cf. A003415, A327936.
%Y A341997 Cf. A327929 (positions of terms > 1), A341996, A341998, A341999.
%K A341997 nonn
%O A341997 2,3
%A A341997 _Antti Karttunen_, Feb 28 2021