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.

A046640 a(n) = A045763(n) + 1.

This page as a plain text file.
%I A046640 #13 Mar 02 2018 22:44:12
%S A046640 1,1,1,1,1,2,1,2,2,4,1,4,1,6,5,5,1,8,1,8,7,10,1,10,4,12,7,12,1,16,1,
%T A046640 12,11,16,9,17,1,18,13,18,1,24,1,20,17,22,1,24,6,26,17,24,1,30,13,26,
%U A046640 19,28,1,34,1,30,23,27,15,40,1,32
%N A046640 a(n) = A045763(n) + 1.
%C A046640 a(n) = number of nondivisors in the cototient of n, including 1. - _Michael De Vlieger_, Feb 25 2018
%H A046640 Antti Karttunen, <a href="/A046640/b046640.txt">Table of n, a(n) for n = 1..65537</a>
%F A046640 a(n) = 2 + n - A000005(n) - A000010(n). - _Antti Karttunen_, Feb 25 2018
%t A046640 Table[Count[Range@ n, _?(And[! CoprimeQ[#, n], ! Divisible[n, #]] &)] + 1, {n, 68}] (* or *)
%t A046640 Array[2 + # - (DivisorSigma[0, #] + EulerPhi[#]) &, 68] (* _Michael De Vlieger_, Feb 25 2018 *)
%o A046640 (PARI) A046640(n) = (2+n-numdiv(n)-eulerphi(n)); \\ _Antti Karttunen_, Feb 25 2018, after _Charles R Greathouse IV_'s program for A045763.
%Y A046640 Cf. A000005, A000010, A045763.
%K A046640 nonn
%O A046640 1,6
%A A046640 _N. J. A. Sloane_
%E A046640 Offset corrected by _Antti Karttunen_, Feb 25 2018