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!)
A137327 Fermat(n) modulo n. 1
0, 1, 2, 1, 2, 5, 5, 1, 5, 7, 4, 5, 10, 3, 2, 1, 2, 17, 5, 17, 5, 17, 4, 17, 22, 17, 14, 17, 17, 17, 9, 1, 5, 19, 12, 17, 34, 17, 23, 17, 38, 17, 5, 21, 32, 7, 22, 17, 5, 17, 2, 17, 43, 53, 37, 17, 29, 55, 21, 17, 58, 17, 5, 1, 62, 17, 22, 53, 65, 17, 13, 17 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,3

COMMENTS

In the first 10000 terms, 17 appears 649 times and 257 appears 781 times. - T. D. Noe, Oct 01 2013

LINKS

T. D. Noe, Table of n, a(n) for n = 1..10000

FORMULA

a(n) = A000215(n) mod n.

MAPLE

with(numtheory):seq(irem(fermat(n), n), n=1..19);

# second Maple program:

a:= n-> (2&^(2^n) + 1) mod n:

seq(a(n), n=1..100); # Alois P. Heinz, Sep 30 2013

MATHEMATICA

Table[Mod[PowerMod[2, 2^n, n] + 1, n], {n, 100}] (* T. D. Noe, Oct 01 2013 *)

CROSSREFS

Cf. A155836.

Sequence in context: A318724 A167482 A328601 * A143913 A228815 A241555

Adjacent sequences:  A137324 A137325 A137326 * A137328 A137329 A137330

KEYWORD

nonn

AUTHOR

Zerinvary Lajos, Apr 20 2008

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 April 20 12:44 EDT 2021. Contains 343135 sequences. (Running on oeis4.)