A290088 -id:A290088 - cp's OEIS frontend

A290087 a(1) = 0; for n > 1, a(n) = A289626(A051953(n)).

0, 1, 1, 1, 1, 2, 1, 2, 2, 2, 1, 5, 1, 5, 4, 5, 1, 5, 1, 5, 4, 5, 1, 8, 3, 4, 4, 8, 1, 6, 1, 8, 7, 4, 6, 13, 1, 8, 8, 13, 1, 8, 1, 13, 11, 13, 1, 17, 4, 8, 10, 11, 1, 11, 8, 17, 11, 8, 1, 18, 1, 17, 10, 17, 9, 12, 1, 11, 14, 12, 1, 21, 1, 10, 19, 21, 9, 10, 1, 21, 10, 11, 1, 21, 11, 18, 16, 21, 1, 18, 10, 21, 18, 21, 12, 25, 1, 28, 19, 21, 1, 19, 1, 28, 29

Offset: 1

Antti Karttunen, Aug 07 2017

nonn

Antti Karttunen, Table of n, a(n) for n = 1..16384

Cf. A051953, A054571, A289626, A290086, A290085, A290086, A290088, A290089.

a(1) = 0; for n > 1, a(n) = A289626(A051953(n)).

A290085 a(n) = A289626(A000005(n)).

Original entry on oeis.org

1, 1, 1, 2, 1, 2, 1, 2, 2, 2, 1, 2, 1, 2, 2, 3, 1, 2, 1, 2, 2, 2, 1, 5, 2, 2, 2, 2, 1, 5, 1, 2, 2, 2, 2, 4, 1, 2, 2, 5, 1, 5, 1, 2, 2, 2, 1, 3, 2, 2, 2, 2, 1, 5, 2, 5, 2, 2, 1, 5, 1, 2, 2, 4, 2, 5, 1, 2, 2, 5, 1, 5, 1, 2, 2, 2, 2, 5, 1, 3, 3, 2, 1, 5, 2, 2, 2, 5, 1, 5, 2, 2, 2, 2, 2, 5, 1, 2, 2, 4, 1, 5, 1, 5, 5, 2, 1, 5, 1, 5, 2, 3, 1, 5, 2, 2, 2, 2, 2, 8

Offset: 1

Antti Karttunen, Aug 07 2017

nonn

Antti Karttunen, Table of n, a(n) for n = 1..16384
Index entries for sequences computed from exponents in factorization of n

Cf. A000005, A163109, A289626, A290086, A290087, A290088.

a(n) = A289626(A000005(n)).

A290086 a(n) = A289626(A000010(n)).

Original entry on oeis.org

1, 1, 1, 1, 2, 1, 2, 2, 2, 2, 3, 2, 5, 2, 5, 5, 8, 2, 4, 5, 5, 3, 6, 5, 8, 5, 4, 5, 11, 5, 8, 8, 8, 8, 13, 5, 11, 4, 13, 8, 21, 5, 11, 8, 13, 6, 12, 8, 11, 8, 17, 13, 19, 4, 21, 13, 11, 11, 15, 8, 21, 8, 11, 17, 21, 8, 18, 17, 18, 13, 19, 13, 28, 11, 21, 11, 21, 13, 19, 17, 10, 21, 22, 13, 25, 11, 28, 21, 45, 13, 28, 18, 21, 12, 28, 17, 49, 11, 21, 21, 27, 17

Offset: 1

Antti Karttunen, Aug 07 2017

nonn

Antti Karttunen, Table of n, a(n) for n = 1..16384

Cf. A000010, A010554, A077197, A277906, A289626, A290085, A290087, A290088.

a(n) = A289626(A000010(n)).

A077198 a(n) = lambda(sigma(n)), where lambda(n) is the Carmichael lambda function, which gives the smallest integer m such that k^m = 1 mod n for all integers k relatively prime to n.

Original entry on oeis.org

1, 2, 2, 6, 2, 2, 2, 4, 12, 6, 2, 6, 6, 2, 2, 30, 6, 12, 4, 6, 8, 6, 2, 4, 30, 6, 4, 6, 4, 6, 8, 6, 4, 18, 4, 12, 18, 4, 6, 12, 6, 8, 10, 6, 12, 6, 4, 30, 18, 30, 6, 42, 18, 4, 6, 4, 4, 12, 4, 6, 30, 8, 12, 126, 6, 12, 16, 6, 8, 12, 6, 12, 36, 18, 30, 12, 8, 6, 4, 30, 110, 6, 6, 24, 18, 10, 4

Offset: 1

Joseph L. Pe, Nov 30 2002

nonn

Antti Karttunen, Table of n, a(n) for n = 1..16384
Index entries for sequences related to sigma(n)

Cf. A000203, A002322.

Cf. also A062401, A290088.

Table[CarmichaelLambda[DivisorSigma[1, n]], {n, 1, 100}]

A077198(n) = lcm(znstar(sigma(n))[2]); \\ Antti Karttunen, Nov 18 2017

a(n) = A002322(A000203(n)). - Antti Karttunen, Nov 18 2017

cp's OEIS Frontend

A290087 a(1) = 0; for n > 1, a(n) = A289626(A051953(n)).

Views

Author

Keywords

Links

Crossrefs

Formula

A290085 a(n) = A289626(A000005(n)).

Views

Author

Keywords

Links

Crossrefs

Formula

A290086 a(n) = A289626(A000010(n)).

Views

Author

Keywords

Links

Crossrefs

Formula

A077198 a(n) = lambda(sigma(n)), where lambda(n) is the Carmichael lambda function, which gives the smallest integer m such that k^m = 1 mod n for all integers k relatively prime to n.

Views

Author

Keywords

Links

Crossrefs

Programs

Mathematica

PARI

Formula