|
Search: id:A090086
|
|
|
| A090086 |
|
Smallest [odd and even] pseudoprimes to base n, not necessarily exceeding n. See A007535. |
|
+0
6
|
|
| 4, 341, 91, 15, 4, 35, 6, 9, 4, 9, 10, 65, 4, 15, 14, 15, 4, 25, 6, 21, 4, 21, 22, 25, 4, 9, 26, 9, 4, 49, 6, 25, 4, 15, 9, 35, 4, 39, 38, 39, 4, 205, 6, 9, 4, 9, 46, 49, 4, 21, 10, 51, 4, 55, 6, 15, 4, 57, 15, 341, 4, 9, 62, 9, 4, 65, 6, 25, 4, 69, 9, 85, 4, 15, 74, 15, 4, 77, 6, 9, 4, 9, 21
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
FORMULA
|
a(n)=Min{x; Mod[ -1+n^(x-1), x]=0}
|
|
EXAMPLE
|
at n=4k+1, a[n]=4
|
|
MATHEMATICA
|
Table[fla=1; Do[s=Mod[ -1+a^(n-1), n]; If[Equal[s, 0]&&!PrimeQ[n]&&Greater[n, 1]&&Equal[fla, 1], Print[{n, a, GCD[n, a]}]; fla=0], {n, 1, 342}], {a, 2, 256}]
|
|
CROSSREFS
|
Cf. A007535.
Sequence in context: A075768 A135442 A086895 this_sequence A007535 A000783 A098654
Adjacent sequences: A090083 A090084 A090085 this_sequence A090087 A090088 A090089
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Labos E. (labos(AT)ana.sote.hu), Nov 25 2003
|
|
|
Search completed in 0.002 seconds
|
