[go: up one dir, main page]

login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
Revision History for A020194 (Underlined text is an addition; strikethrough text is a deletion.)

Showing entries 1-10 | older changes
A020194 Pseudoprimes to base 66.
(history; published version)
#18 by Susanna Cuyler at Wed Jun 13 09:17:58 EDT 2018
STATUS

proposed

approved

#17 by Jon E. Schoenfield at Tue Jun 12 23:13:17 EDT 2018
STATUS

editing

proposed

#16 by Jon E. Schoenfield at Tue Jun 12 23:13:13 EDT 2018
COMMENTS

Composite numbers n such that 66^(n-1) == 1 (mod n). [From ). - _Michel Lagneau, _, Feb 18 2012]

STATUS

approved

editing

#15 by Charles R Greathouse IV at Sun Aug 03 14:01:12 EDT 2014
MATHEMATICA

base = 66; t = {}; n = 1; While[Length[t] < 100, n++; If[! PrimeQ[n] && PowerMod[base, n-1, n] == 1, AppendTo[t, n]]]; t (* (* _T. D. Noe, _, Feb 21 2012 *)

Discussion
Sun Aug 03 14:01
OEIS Server: https://oeis.org/edit/global/2267
#14 by Russ Cox at Fri Mar 30 18:35:12 EDT 2012
AUTHOR

_David W. Wilson (davidwwilson(AT)comcast.net)_

Discussion
Fri Mar 30 18:35
OEIS Server: https://oeis.org/edit/global/202
#13 by T. D. Noe at Tue Feb 21 16:31:14 EST 2012
STATUS

editing

approved

#12 by T. D. Noe at Tue Feb 21 16:31:09 EST 2012
LINKS

<a href="/index/Ps#pseudoprimes">Index entries for sequences related to pseudoprimes</a>

<a href="/index/Ps#pseudoprimes">Index entries for sequences related to pseudoprimes</a>

#11 by T. D. Noe at Tue Feb 21 16:30:44 EST 2012
COMMENTS

Composite numbers n such that (n- 66)^(^(n-1) == 1( (mod n). [From Michel Lagneau, Feb 18 2012]

LINKS

T. D. Noe, <a href="/A020194/b020194.txt">Table of n, a(n) for n = 1..1000</a>

MATHEMATICA

base = 66; t = {}; n = 1; While[Length[t] < 100, n++; If[! PrimeQ[n] && PowerMod[base, n-1, n] == 1, AppendTo[t, n]]]; t (* T. D. Noe, Feb 21 2012 *)

CROSSREFS

Cf. A001567 (pseudoprimes to base 2).

STATUS

proposed

editing

#10 by Michel Lagneau at Sat Feb 18 11:12:38 EST 2012
STATUS

editing

proposed

#9 by Michel Lagneau at Sat Feb 18 11:12:34 EST 2012
COMMENTS

Composite numbers n such that (n-66)^(n-1) == 1( mod n). [From Michel Lagneau, Feb 18 2012]

STATUS

approved

editing

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified August 30 11:31 EDT 2024. Contains 375543 sequences. (Running on oeis4.)