[go: up one dir, main page]

login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

Revision History for A128160 (Bold, blue-underlined text is an addition; faded, red-underlined text is a deletion.)

Showing all changes.
a(n) = least k such that the remainder when 20^k is divided by k is n.
(history; published version)
#10 by Joerg Arndt at Sat Aug 01 05:55:27 EDT 2015
STATUS

reviewed

approved

#9 by Michel Marcus at Sat Aug 01 05:04:36 EDT 2015
STATUS

proposed

reviewed

#8 by Jon E. Schoenfield at Sat Aug 01 05:03:11 EDT 2015
STATUS

editing

proposed

#7 by Jon E. Schoenfield at Sat Aug 01 05:02:54 EDT 2015
MATHEMATICA

t = Table[0, {10000} ]; k = 1; While[ k < 4000000000, a = PowerMod[20, k, k]; If[a < 10001 && t[[a]] == 0, t[[a]] = k; Print[{a, k}]]; k++ ]; t [From _(* _Robert G. Wilson v_, Aug 04 2009] *)

EXTENSIONS

Copied more More terms copied from a-file _by _Hagen von Eitzen_, Oct 22 2009

STATUS

approved

editing

#6 by Russ Cox at Sat Mar 31 14:12:21 EDT 2012
EXTENSIONS

Copied more terms from a-file _Hagen von Eitzen (math(AT)von-eitzen.de), _, Oct 22 2009

Discussion
Sat Mar 31
14:12
OEIS Server: https://oeis.org/edit/global/932
#5 by Russ Cox at Sat Mar 31 13:20:35 EDT 2012
AUTHOR

_Alexander Adamchuk (alex(AT)kolmogorov.com), _, Feb 16 2007

Discussion
Sat Mar 31
13:20
OEIS Server: https://oeis.org/edit/global/879
#4 by Russ Cox at Fri Mar 30 17:31:22 EDT 2012
MATHEMATICA

t = Table[0, {10000} ]; k = 1; While[ k < 4000000000, a = PowerMod[20, k, k]; If[a < 10001 && t[[a]] == 0, t[[a]] = k; Print[{a, k}]]; k++ ]; t [From _Robert G. Wilson v (rgwv(AT)rgwv.com), _, Aug 04 2009]

Discussion
Fri Mar 30
17:31
OEIS Server: https://oeis.org/edit/global/156
#3 by N. J. A. Sloane at Thu Nov 11 07:34:06 EST 2010
LINKS

Robert G. Wilson v, <a href="/A128160/a128160.txt">Table of n, a(n) for n = 1..10000 with -1 for large entries where a(n) has not yet been found</a>

KEYWORD

hard,nonn,new

#2 by N. J. A. Sloane at Tue Jun 01 03:00:00 EDT 2010
DATA

19, 3, 17, 6, 15, 7, 13, 9, 11, 18, 7989, 92, 973, 33, 611, 24, 2661, 382, 559, 21, 96641237093, 42, 1887, 94, 155, 27, 60403, 36, 7971, 74, 1172954777, 46, 2470227509, 122, 45, 116, 1837, 362, 779, 60, 469, 358, 1275143, 51, 55, 118, 723, 49

LINKS

Robert G. Wilson v, <a href="a128160.txt">Table of n, a(n) for n = 1..10000 with -1 for large entries where a(n) has not yet been found</a>

MATHEMATICA

t = Table[0, {10000} ]; k = 1; While[ k < 4000000000, a = PowerMod[20, k, k]; If[a < 10001 && t[[a]] == 0, t[[a]] = k; Print[{a, k}]]; k++ ]; t [From Robert G. Wilson v (rgwv(AT)rgwv.com), Aug 04 2009]

KEYWORD

hard,more,nonn,new

EXTENSIONS

Copied more terms from a-file Hagen von Eitzen (math(AT)von-eitzen.de), Oct 22 2009

#1 by N. J. A. Sloane at Fri May 11 03:00:00 EDT 2007
NAME

a(n) = least k such that the remainder when 20^k is divided by k is n.

DATA

19, 3, 17, 6, 15, 7, 13, 9, 11, 18, 7989, 92, 973, 33, 611, 24, 2661, 382, 559, 21

OFFSET

1,1

KEYWORD

hard,more,nonn

AUTHOR

Alexander Adamchuk (alex(AT)kolmogorov.com), Feb 16 2007

STATUS

approved