The On-Line Encyclopedia of Integer Sequences (OEIS)

Revision History for A066601 (Bold, blue-underlined text is an addition; faded, red-underlined text is a ~~deletion~~.)
Showing entries 1-10 | older changes

A066601

a(n) = 3^n mod n.
(history; published version)

#23 by Joerg Arndt at Thu Aug 24 12:01:49 EDT 2023

STATUS

reviewed

approved

#22 by Michel Marcus at Thu Aug 24 10:33:02 EDT 2023

STATUS

proposed

reviewed

#21 by Chai Wah Wu at Thu Aug 24 10:27:58 EDT 2023

STATUS

editing

proposed

#20 by Chai Wah Wu at Thu Aug 24 10:27:52 EDT 2023

PROG

(Python)

def A066601(n): return pow(3, n, n) # Chai Wah Wu, Aug 24 2023

STATUS

approved

editing

#19 by Bruno Berselli at Thu Dec 01 06:07:28 EST 2016

STATUS

editing

approved

#18 by Bruno Berselli at Thu Dec 01 06:07:25 EST 2016

CROSSREFS

Cf. k^n mod n; : A015910 (k=2), this sequence (k=3), A066602 (k=4), A066603 (k=5), A066604 (k=6), A066438 (k=7), A066439 (k=8), A066440 (k=9), A056969 (k=10), A066441 (k=11), A066442 (k=12), A116609 (k=13).

STATUS

approved

editing

#17 by OEIS Server at Thu Dec 01 05:49:08 EST 2016

LINKS

Harry J. Smith and Seiichi Manyama, <a href="/A066601/b066601_1.txt">Table of n, a(n) for n = 1..10000</a> (first 1000 terms from Harry J. Smith)

#16 by Bruno Berselli at Thu Dec 01 05:49:08 EST 2016

STATUS

proposed

approved

Discussion

Thu Dec 01

05:49

OEIS Server: Installed new b-file as b066601.txt.  Old b-file is now b066601_1.txt.

#15 by Seiichi Manyama at Thu Dec 01 05:23:16 EST 2016

STATUS

editing

proposed

#14 by Seiichi Manyama at Thu Dec 01 05:17:56 EST 2016

CROSSREFS

Cf. k^n mod n; A015910 (k=2), this sequence (k=3), A066602 (k=4), A066603 (k=5), A066604 (k=6), A066438 (k=7), A066439 (k=8), A066440 (k=9), A056969 (k=10), A066441 (k=11), A066442 (k=12), A116609 (k=13).