A318411 Least k (>1) such that m^k == m mod A005117(n) for 0 <= m <= A005117(n) - 1.

2, 3, 5, 3, 7, 5, 11, 13, 7, 5, 17, 19, 7, 11, 23, 13, 29, 5, 31, 11, 17, 13, 37, 19, 13, 41, 7, 43, 23, 47, 17, 53, 21, 19, 29, 59, 61, 31, 13, 11, 67, 23, 13, 71, 73, 37, 31, 13, 79, 41, 83, 17, 43, 29, 89, 13, 31, 47, 37, 97, 101, 17, 103, 13, 53, 107, 109, 21, 37, 113, 19

Offset: 2

Author

Seiichi Manyama, Aug 26 2018

Keywords

• nonn

Comments

This sequence is different from A073482.

Examples

			A005117(5) = 6.
    0^3  =   0 == 0 mod 6,
    1^3  =   1 == 1 mod 6,
    2^3  =   8 == 2 mod 6,
    3^3  =  27 == 3 mod 6,
    4^3  =  64 == 4 mod 6,
    5^3  = 125 == 5 mod 6.
------------------------------------------------
A005117(23) = 35.
    0^13 =                    0 ==  0 mod 35,
    1^13 =                    1 ==  1 mod 35,
    2^13 =                 8192 ==  2 mod 35,
   ...
   34^13 = 81138303245565435904 == 34 mod 35.
------------------------------------------------
------+------------+------
   n  | A005117(n) | a(n)
------+------------+------
    2 |          2 |    2
    3 |          3 |    3
    4 |          5 |    5
    5 |          6 |    3
    6 |          7 |    7
    7 |         10 |    5
    8 |         11 |   11
    9 |         13 |   13
   10 |         14 |    7
   11 |         15 |    5
   12 |         17 |   17
   13 |         19 |   19
   14 |         21 |    7
   15 |         22 |   11
   16 |         23 |   23
   17 |         26 |   13
   18 |         29 |   29
   19 |         30 |    5
   20 |         31 |   31
   21 |         33 |   11
   22 |         34 |   17
   23 |         35 |   13
		

Links

• Seiichi Manyama, Table of n, a(n) for n = 2..10000

Crossrefs

Cf. A005117, A318572.