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.

A199105 Numbers k such that lambda(k) < A011773(k) < phi(k), where lambda is the Carmichael reduced totient function and phi the Euler totient function.

This page as a plain text file.
%I A199105 #34 Mar 08 2020 08:33:21
%S A199105 24,48,56,72,80,88,96,112,144,152,160,168,176,184,192,208,216,224,240,
%T A199105 248,264,288,304,320,336,344,352,368,376,384,392,400,416,432,448,456,
%U A199105 464,472,480,496,504,528,536,552,560,568,576,592,608,616,624
%N A199105 Numbers k such that lambda(k) < A011773(k) < phi(k), where lambda is the Carmichael reduced totient function and phi the Euler totient function.
%C A199105 A002322(k) divides A011773(k) and A011773(k) divides A000010(k).
%H A199105 Amiram Eldar, <a href="/A199105/b199105.txt">Table of n, a(n) for n = 1..10000</a>
%t A199105 A011773[p_,s_] := (p-1)*p^(s-1); A011773[n_] := {aux=1;Do[aux=LCM[aux,A011773[FactorInteger[n][[i,1]], FactorInteger[n][[i,2]]]], {i,Length[FactorInteger[n]]}]; aux}[[1]]; Select[Range[1000], CarmichaelLambda[#] < A011773[#] < EulerPhi[#]&]
%Y A199105 Cf. A000010, A002322, A011773.
%K A199105 nonn
%O A199105 1,1
%A A199105 _José María Grau Ribas_, Jan 31 2012