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.

A088232 Numbers k such that 3 does not divide phi(k).

This page as a plain text file.
%I A088232 #36 May 18 2022 10:07:08
%S A088232 1,2,3,4,5,6,8,10,11,12,15,16,17,20,22,23,24,25,29,30,32,33,34,40,41,
%T A088232 44,46,47,48,50,51,53,55,58,59,60,64,66,68,69,71,75,80,82,83,85,87,88,
%U A088232 89,92,94,96,100,101,102,106,107,110,113,115,116,118,120,121,123,125,128
%N A088232 Numbers k such that 3 does not divide phi(k).
%C A088232 n such that the congruence x^3 == 1 mod(n) has only the trivial solution x=1 i.e. A060839(n) = 1 . Complement of sequence A066498.
%C A088232 Let U(n) be the group of positive integers coprime to n under mod n multiplication.  Let U(n)^3 = {x^3: x is an element of U(n)}.  These are the n such that U(n) = U(n)^3. - _Geoffrey Critzer_, Jun 07 2015
%C A088232 In other words, numbers divisible neither by 9 nor by any primes of the form 6k+1. - _Ivan Neretin_, Sep 03 2015
%C A088232 The asymptotic density of this sequence is 0 (Dressler, 1975). - _Amiram Eldar_, Jul 23 2020
%H A088232 Charles R Greathouse IV, <a href="/A088232/b088232.txt">Table of n, a(n) for n = 1..10000</a>
%H A088232 Robert E. Dressler, <a href="http://www.numdam.org/item/?id=CM_1975__31_2_115_0">A property of the phi and sigma_j functions</a>, Compositio Mathematica, Vol. 31, No. 2 (1975), pp. 115-118.
%H A088232 Kevin Ford, Florian Luca, and Pieter Moree, <a href="http://arxiv.org/abs/1108.3805">Values of the Euler phi-function not divisible by a given odd prime, and the distribution of Euler-Kronecker constants for cyclotomic fields</a>, arXiv:1108.3805 [math.NT], 2011-2012.
%F A088232 a(n) ~ k n sqrt(log(n)) for some constant k. k appears to be around 1.08. [_Charles R Greathouse IV_, Feb 14 2012]
%p A088232 select(t -> numtheory:-phi(t) mod 3 <> 0, [$1..1000]); # _Robert Israel_, Sep 04 2015
%t A088232 Prepend[Position[Table[Union[Select[Range[n], CoprimeQ[#, n] &]] ==
%t A088232      Union[Mod[Select[Range[n], CoprimeQ[#, n] &]^3, n]], {n, 1,155}], True], 1] // Flatten (* _Geoffrey Critzer_, Jun 07 2015 *)
%t A088232 Select[Range[140],!Divisible[EulerPhi[#],3]&] (* _Harvey P. Dale_, Sep 23 2017 *)
%o A088232 (PARI) is(n)=eulerphi(n)%3 \\ _Charles R Greathouse IV_, Feb 04 2013
%Y A088232 Cf. A000010, A066498 (complement).
%Y A088232 Positions of 1's in A060839, of 0's in A354099, of nonzeros in A074942.
%Y A088232 Cf. also A329963.
%K A088232 nonn
%O A088232 1,2
%A A088232 Yuval Dekel (dekelyuval(AT)hotmail.com), Nov 03 2003
%E A088232 More terms from _Ray Chandler_, Nov 05 2003