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.

A319699 a(n) = A001065(A252463(n)).

This page as a plain text file.
%I A319699 #12 Nov 22 2018 18:16:16
%S A319699 0,0,1,1,1,1,1,3,3,1,1,6,1,1,6,7,1,4,1,8,8,1,1,16,4,1,7,10,1,9,1,15,
%T A319699 10,1,9,21,1,1,14,22,1,11,1,14,16,1,1,36,6,6,16,16,1,13,11,28,20,1,1,
%U A319699 42,1,1,22,31,15,15,1,20,22,13,1,55,1,1,21,22,13,17,1,50,15,1,1,54,17,1,26,40,1,33,17,26,32,1,21,76,1,8,28,43,1,21,1,46,42
%N A319699 a(n) = A001065(A252463(n)).
%C A319699 Also for n > 1, sum of A318889(x) for all x encountered when map x -> A252463(x) is iterated, starting from x = A252463(n), until 1 is reached.
%H A319699 Antti Karttunen, <a href="/A319699/b319699.txt">Table of n, a(n) for n = 1..16384</a>
%F A319699 a(n) = A001065(A252463(n)).
%F A319699 a(n) = A001065(n) - A318889(n).
%o A319699 (PARI)
%o A319699 A001065(n) = (sigma(n)-n);
%o A319699 A064989(n) = {my(f); f = factor(n); if((n>1 && f[1,1]==2), f[1,2] = 0); for (i=1, #f~, f[i,1] = precprime(f[i,1]-1)); factorback(f)};
%o A319699 A252463(n) = if(!(n%2),n/2,A064989(n));
%o A319699 A319699(n) = A001065(A252463(n));
%Y A319699 Cf. A001065, A005940, A252463, A318889.
%Y A319699 Cf. also A319694, A319700, A319703, A319989, A320107, A320111.
%K A319699 nonn
%O A319699 1,8
%A A319699 _Antti Karttunen_, Nov 22 2018