|
| |
|
|
A071294
|
|
Number of a, 1<=a<=2*n so that if 2*n=2^k*m and gcd(2,m)=1 the sequence modulo 2*n+1 (a^m,a^(2*m),...,a^(2^k*m)) satisfies the Rabin-Miller test.
|
|
2
| |
|
|
2, 4, 6, 2, 10, 12, 2, 16, 18, 2, 22, 4, 2, 28, 30, 2, 2, 36, 2, 40, 42, 2, 46, 6, 2, 52, 2, 2, 58, 60, 2, 6, 66, 2, 70, 72, 2, 2, 78, 2, 82, 6, 2, 88, 18, 2, 2, 96, 2, 100, 102, 2, 106, 108, 2, 112, 2, 2, 2, 10, 2, 4, 126, 2, 130, 18, 2, 136, 138, 2, 2, 6, 2, 148, 150, 2, 2, 156, 2, 2
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 1,1
|
|
|
MAPLE
| rabinmiller := proc(n, a); k := 0; mu := n-1; while irem(mu, 2)=0 do k := k+1; mu := mu/2 od; G := a&^mu mod(n); h := 0; if G=1 then RETURN(1) else while h<k-1 and G&^2 mod n <>1 do h := h+1; G := G&^2 mod n; od; if h<k and G<> n-1 then RETURN(0) else RETURN(1) fi; if G=1 then RETURN(1); fi; fi; end; compte := proc(n) local l; RETURN(sum('rabinmiller(2*n+1, l)', 'l'=1..2*n)); end;
|
|
|
CROSSREFS
| Different from A060684.
Sequence in context: A053446 A133903 A094752 * A060684 A056134 A097009
Adjacent sequences: A071291 A071292 A071293 * A071295 A071296 A071297
|
|
|
KEYWORD
| nonn
|
|
|
AUTHOR
| J.-F. Guiffes (guiffes.jean-francois(AT)wanadoo.fr), Jun 11 2002
|
| |
|
|
