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.

A015733 Numbers k such that d(k) does not divide phi(k).

This page as a plain text file.
%I A015733 #46 May 15 2024 01:31:57
%S A015733 2,4,6,12,14,16,20,22,25,27,32,36,38,42,44,46,48,50,54,60,62,64,66,68,
%T A015733 75,80,81,86,92,94,96,100,112,114,116,118,121,132,134,138,142,144,150,
%U A015733 154,158,160,162,164,166,180,186,188,189,192,196,200,204
%N A015733 Numbers k such that d(k) does not divide phi(k).
%H A015733 Michael De Vlieger, <a href="/A015733/b015733.txt">Table of n, a(n) for n = 1..18157</a> (first 2000 terms from Enrique Pérez Herrero)
%t A015733 Select[Range[204], ! Divisible[EulerPhi[#], DivisorSigma[0, #]] &]
%o A015733 (PARI) is(k) = {my(f = factor(k), d = numdiv(f), p = eulerphi(f)); p % d;} \\ _Amiram Eldar_, May 15 2024
%Y A015733 Cf. A000005 (d), A000010 (phi), A015734, A020491 (d(k) does divide phi(k)).
%K A015733 nonn
%O A015733 1,1
%A A015733 _Robert G. Wilson v_