login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A070669 Smallest m in range 2..n-1 such that m^4 == 1 mod n, or 1 if no such number exists. 1
1, 1, 2, 3, 2, 5, 6, 3, 8, 3, 10, 5, 5, 13, 2, 3, 4, 17, 18, 3, 8, 21, 22, 5, 7, 5, 26, 13, 12, 7, 30, 7, 10, 13, 6, 17, 6, 37, 5, 3, 9, 13, 42, 21, 8, 45, 46, 5, 48, 7, 4, 5, 23, 53, 12, 13, 20, 17, 58, 7, 11, 61, 8, 15, 8, 23, 66, 13, 22, 13, 70, 17, 27, 31, 7 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,3

LINKS

Alois P. Heinz, Table of n, a(n) for n = 1..10000

MAPLE

a:= proc(n) local m;

      for m from 2 to n-1 do

        if m &^ 4 mod n = 1 then return m fi

      od; 1

    end:

seq(a(n), n=1..100);  # Alois P. Heinz, Jun 29 2014

MATHEMATICA

a[n_] := (For[m = 2, m <= n - 1, m++, If[PowerMod[m, 4, n] == 1, Return[m]]]; 1); Table[a[n], {n, 1, 100}] (* Jean-Fran├žois Alcover, Jul 20 2015 *)

PROG

(PARI) a(n) = {for (m=2, n-1, if (lift(Mod(m, n)^4) == 1, return (m)); ); return (1); } \\ Michel Marcus, Jun 29 2014

CROSSREFS

Cf. A070667.

Sequence in context: A214571 A135873 A070673 * A218613 A164912 A289386

Adjacent sequences:  A070666 A070667 A070668 * A070670 A070671 A070672

KEYWORD

nonn

AUTHOR

N. J. A. Sloane, May 08 2002

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified August 5 01:51 EDT 2021. Contains 346456 sequences. (Running on oeis4.)