A002616 -id:A002616 - cp's OEIS frontend

A185026 The first bisection of the sequence A002616 of reduced totients.

1, 2, 3, 3, 5, 6, 2, 8, 9, 3, 11, 10, 9, 14, 15, 5, 6, 18, 6, 20, 21, 6, 23, 21, 8, 26, 10, 9, 29, 30, 3, 6, 33, 11, 35, 36, 10, 15, 39, 27, 41, 8, 14, 44, 6, 15, 18, 48, 15, 50, 51, 6, 53, 54, 18, 56, 22, 6, 24, 55, 20, 50, 63, 21, 65, 9, 18, 68, 69, 23, 30, 14, 21, 74, 75, 24, 30, 78, 26, 33

Offset: 1

Paul Curtz, Dec 24 2012

nonn

Fixed points n where n=a(n) are n=1, 2, 3, 5, 6, 8, 9, 11,... = A005097.

There are pairs of the consecutive terms of the form (3*k,k): 6,2, 9,3, 15,5, 18,6, 33,11, 54,18, 63,21, 69,23, 78,26, ... . It seems that k is the set of all A174100(n), n>1, plus a few exceptions (like the pair 126, 42).

G. C. Greubel, Table of n, a(n) for n = 1..5000

A185026 := proc(n)
        numtheory[lambda](2*n+1)/2 ;
end proc: # R. J. Mathar, Mar 27 2013

Table[ CarmichaelLambda[2*n + 1]/2, {n, 1, 80}] (* Jean-François Alcover, Apr 04 2013 *)

a(n) = A002616(2*n+1).

A002322 Reduced totient function psi(n): least k such that x^k == 1 (mod n) for all x prime to n; also known as the Carmichael lambda function (exponent of unit group mod n); also called the universal exponent of n.

Original entry on oeis.org

1, 1, 2, 2, 4, 2, 6, 2, 6, 4, 10, 2, 12, 6, 4, 4, 16, 6, 18, 4, 6, 10, 22, 2, 20, 12, 18, 6, 28, 4, 30, 8, 10, 16, 12, 6, 36, 18, 12, 4, 40, 6, 42, 10, 12, 22, 46, 4, 42, 20, 16, 12, 52, 18, 20, 6, 18, 28, 58, 4, 60, 30, 6, 16, 12, 10, 66, 16, 22, 12, 70, 6, 72, 36, 20, 18, 30, 12, 78, 4, 54

Offset: 1

N. J. A. Sloane

a(n) is the largest order of any element in the multiplicative group modulo n. - Joerg Arndt, Mar 19 2016

Largest period of repeating digits of 1/n written in different bases (i.e., largest value in each row of square array A066799 and least common multiple of each row). - Henry Bottomley, Dec 20 2001

D. H. Lehmer, Guide to Tables in the Theory of Numbers. Bulletin No. 105, National Research Council, Washington, DC, 1941, pp. 7-10.
W. J. LeVeque, Topics in Number Theory. Addison-Wesley, Reading, MA, 2 vols., 1956, Vol. 1, p. 53.
Kenneth H. Rosen, Elementary Number Theory and Its Applications, Addison-Wesley, 1984, page 269.
N. J. A. Sloane, A Handbook of Integer Sequences, Academic Press, 1973 (includes this sequence).
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

T. D. Noe, Table of n, a(n) for n = 1..10000
L. Blum, M. Blum, and M. Shub, A simple unpredictable pseudorandom number generator, SIAM J. Comput. 15 (1986), no. 2, 364-383. see p. 377.
P. J. Cameron and D. A. Preece, Notes on primitive lambda-roots
R. D. Carmichael, Note on a new number theory function, Bull. Amer. Math. Soc. 16 (1909-10), 232-238.
A. Cauchy, Mémoire sur la résolution des équations indéterminées du premier degré en nombres entiers, Oeuvres Complètes. Gauthier-Villars, Paris, 1882-1938, Series (2), Vol. 12, pp. 9-47.
A. de Vries, The prime factors of an integer(along with Euler's phi and Carmichael's lambda functions), Applet
Paul Erdős, Carl Pomerance, and Eric Schmutz, Carmichael's lambda function, Acta Arithmetica 58 (1991), pp. 363-385.
J.-H. Evertse and E. van Heyst, Which new RSA signatures can be computed from some given RSA signatures?, Proceedings of Eurocrypt '90, Lect. Notes Comput. Sci., 473, Springer-Verlag, pp. 84-97, see page 86.
J. M. Grau and A. M. Oller-Marcén, On the congruence sum_{j=1}^{n-1} j^{k(n-1)} == -1 (mod n); k-strong Giuga and k-Carmichael numbers, arXiv preprint arXiv:1311.3522 [math.NT], 2013.
Romeo Meštrović, Generalizations of Carmichael numbers I, arXiv:1305.1867v1 [math.NT], May 04 2013.
P. Pollack, Analytic and Combinatorial Number Theory Course Notes, p. 80.
Benjamin Schreyer, Rigged Horse Numbers and their Modular Periodicity, arXiv:2409.03799 [math.CO], 2024. See p. 12.
Eric Weisstein's World of Mathematics, Carmichael Function
Wikipedia, Carmichael function
Wolfram Research, First 50 values of Carmichael lambda(n)
Index entries for "core" sequences

Cf. A011773, A002174, A002616, A034380, A061258, A062373, A141258, A162578 (partial sums), A218342.

a002322 n = foldl lcm 1 $ map (a207193 . a095874) $
                          zipWith (^) (a027748_row n) (a124010_row n)
-- Reinhard Zumkeller, Feb 16 2012

[1] cat [ CarmichaelLambda(n) : n in [2..100]];

with(numtheory); A002322 := lambda; [seq(lambda(n), n=1..100)];

Table[CarmichaelLambda[k], {k, 50}] (* Artur Jasinski, Apr 05 2008 *)

A002322(n)= lcm( apply( f -> (f[1]-1)*f[1]^(f[2]-1-(f[1]==2 && f[2]>2)), Vec(factor(n)~))) \\ M. F. Hasler, Jul 05 2009

a(n)=lcm(znstar(n)[2]) \\ Charles R Greathouse IV, Aug 04 2012

from sympy import reduced_totient
def A002322(n): return reduced_totient(n) # Chai Wah Wu, Feb 24 2021

If M = 2^e*P1^e1*P2^e2*...*Pk^ek, lambda(2^e) = 2^(e-1) if e=1 or 2, = 2^(e-2) if e > 2; lambda(M) = lcm(lambda(2^e), (P1-1)*P1^(e1-1), (P2-1)*P2^(e2-1), ..., (Pk-1)*Pk^(ek-1)).

a(n) = lcm_{k=1..A001221(n)} A207193(A095874(A027748(n,k)^A124010(n,k))). - Reinhard Zumkeller, Feb 16 2012

cp's OEIS Frontend

A185026 The first bisection of the sequence A002616 of reduced totients.

Views

Author

Keywords

Comments

Links

Programs

Maple

Mathematica

Formula

A002322 Reduced totient function psi(n): least k such that x^k == 1 (mod n) for all x prime to n; also known as the Carmichael lambda function (exponent of unit group mod n); also called the universal exponent of n.

Views

Author

Keywords

Comments

References

Links

Crossrefs

Programs

Haskell

Magma

Maple

Mathematica

PARI

PARI

Python

Formula