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.

A333793 a(n) = A333794(n) - A073934(n).

This page as a plain text file.
%I A333793 #11 Apr 06 2020 18:23:48
%S A333793 0,0,0,0,0,1,1,0,1,3,3,3,3,8,5,0,0,6,6,9,12,18,18,7,9,18,6,22,22,18,
%T A333793 18,0,30,15,24,16,16,33,28,21,21,37,37,48,24,69,69,15,37,36,29,48,48,
%U A333793 25,54,50,49,77,77,44,44,73,49,0,56,83,83,45,113,75,75,36,36,71,54,87,87,81,81,45,25,84,84,87,57,128,119,108,108,71
%N A333793 a(n) = A333794(n) - A073934(n).
%H A333793 Antti Karttunen, <a href="/A333793/b333793.txt">Table of n, a(n) for n = 1..65537</a>
%F A333793 a(n) = A333794(n) - A073934(n).
%F A333793 a(p) = a(p-1), for all primes p.
%F A333793 a(A000079(n)) = a(A019434(n)) = 0, for all applicable n.
%o A333793 (PARI)
%o A333793 A073934(n) = if(1==n,n,n + A073934(n-(n/vecmin(factor(n)[,1]))));
%o A333793 A333794(n) = if(1==n,n,n + A333794(n-(n/vecmax(factor(n)[, 1]))));
%o A333793 A333793(n) = (A333794(n)-A073934(n));
%Y A333793 Cf. A000079, A019434, A032742, A052126, A073934, A332904, A333123, A333794.
%Y A333793 Partial sums of A333792.
%K A333793 nonn
%O A333793 1,10
%A A333793 _Antti Karttunen_, Apr 05 2020