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.

A083247 Numbers k such that A000010(k) > A045763(k) > A000005(k).

This page as a plain text file.
%I A083247 #19 Feb 09 2025 02:47:48
%S A083247 14,20,21,22,26,27,28,32,33,34,35,38,39,44,45,46,49,51,52,55,57,58,62,
%T A083247 63,64,65,68,69,74,75,76,77,81,82,85,86,87,91,92,93,94,95,99,106,111,
%U A083247 115,116,117,118,119,121,122,123,124,125,128,129,133,134,135,141,142
%N A083247 Numbers k such that A000010(k) > A045763(k) > A000005(k).
%C A083247 Primes are not terms since A045763(p) = 0 < A000005(p) = 2 for a prime p.
%H A083247 Amiram Eldar, <a href="/A083247/b083247.txt">Table of n, a(n) for n = 1..10000</a>
%e A083247 k = 99 is a term since d(k) = 6, phi(k) = 60, unrelateds(k) = 99 - 6 - 60 + 1 = 34, and 60 > 34 > 6 holds.
%t A083247 Do[r=EulerPhi[n]; d=DivisorSigma[0, n]; u=n-r-d+1; If[Greater[r, u]&&Greater[u, d], Print[n, {d, r, u}]], {n, 1, 1000}]
%o A083247 (PARI) is(n)=my(r=eulerphi(n),d=numdiv(n),u=n-r-d+1); r>u && u>d \\ _Charles R Greathouse IV_, Feb 21 2013
%Y A083247 Cf. A000005, A000010, A045763, A073757, A083243, A083244, A083245, A083246, A083248, A020488.
%K A083247 nonn,less
%O A083247 1,1
%A A083247 _Labos Elemer_, May 07 2003