login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A070672 Smallest m in range 2..n-1 such that m^7 == 1 mod n, or 1 if no such number exists. 1
1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 4, 1, 1, 1, 1, 1, 8, 1, 1, 1, 1, 1, 1, 1, 1, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 11, 7, 1, 1, 1, 1, 1 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,29

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 &^ 7 mod n = 1 then return m fi

      od; 1

    end:

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

PROG

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

CROSSREFS

Cf. A070667.

Sequence in context: A281115 A249776 A053878 * A319101 A239700 A304906

Adjacent sequences:  A070669 A070670 A070671 * A070673 A070674 A070675

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 October 19 22:55 EDT 2019. Contains 328244 sequences. (Running on oeis4.)