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.

A292786 a(n) = psi(n) - phi(n).

This page as a plain text file.
%I A292786 #26 Dec 05 2023 08:11:48
%S A292786 0,2,2,4,2,10,2,8,6,14,2,20,2,18,16,16,2,30,2,28,20,26,2,40,10,30,18,
%T A292786 36,2,64,2,32,28,38,24,60,2,42,32,56,2,84,2,52,48,50,2,80,14,70,40,60,
%U A292786 2,90,32,72,44,62,2,128,2,66,60,64,36,124,2,76,52,120,2,120,2,78,80,84,36,144
%N A292786 a(n) = psi(n) - phi(n).
%C A292786 Even numbers that are not the terms of this sequence are 12, 102, 114, 130, ...
%H A292786 Antti Karttunen, <a href="/A292786/b292786.txt">Table of n, a(n) for n = 1..65537</a>
%F A292786 a(n) = A001615(n) - A000010(n).
%F A292786 a(n) = 2 iff n is prime.
%F A292786 a(n) = 2*A069359(n) iff n is in A070915.
%F A292786 Sum_{k=1..n} a(k) = c * n^2 + O(n*log(n)), where c =  9/(2*Pi^2) = 0.455945... (A088245). - _Amiram Eldar_, Dec 05 2023
%t A292786 psi[n_] := If[n < 1, 0, n Sum[ MoebiusMu[d]^2/d, {d, Divisors@ n}]]; Array[psi@# - EulerPhi@# &, 87] (* _Robert G. Wilson v_, Sep 23 2017 *)
%o A292786 (PARI) a001615(n) = my(f=factor(n)); prod(i=1, #f~, f[i, 1]^f[i, 2] + f[i, 1]^(f[i, 2]-1));
%o A292786 a(n) = a001615(n) - eulerphi(n); \\ after _Charles R Greathouse IV_ at A001615
%Y A292786 Cf. A000010, A001615, A051612, A069359, A070915, A088245, A291784.
%K A292786 nonn,easy,look
%O A292786 1,2
%A A292786 _Altug Alkan_, Sep 23 2017