|
Search: id:A099863
|
|
|
| A099863 |
|
A permutation of the odd primes that satisfy the condition that the sequence modulo 2^n has period 2^(n-1) for all n>0, where the least unused primes are chosen in the process. |
|
+0
2
|
|
| 3, 5, 7, 17, 11, 13, 31, 41, 19, 53, 23, 97, 59, 29, 47, 89, 163, 37, 103, 113, 43, 109, 127, 73, 179, 149, 311, 193, 283, 61, 79, 313, 67, 197, 71, 337, 331, 461, 223, 233, 83, 373, 599, 673, 251, 349, 239, 281, 227, 101, 167, 433, 107, 173, 191, 137, 499, 853, 503
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
COMMENT
|
Index of primes is given by A099864.
|
|
LINKS
|
Paul D. Hanna, Table of n, a(n) for n = 1..4096
|
|
EXAMPLE
|
The sequence is of period 2^(n-1) modulo 2^n, for all n>0, and consists of all odd numbers less than 2^n:
[1, 1, 1, 1, 1, 1, 1, 1, 1, ...] (mod 2)
[3,1, 3,1, 3,1, 3,1, 3,1, 3,1, ...] (mod 4)
[3,5,7,1, 3,5,7,1, 3,5,7,1, 3,5,7,1, ...] (mod 8)
[3,5,7,1,11,13,15,9, 3,5,7,1,11,13,15,9, ...] (mod 16)
[3,5,7,17,11,13,31,9,19,21,23,1,27,29,15,25, ...] (mod 32)
|
|
PROGRAM
|
(PARI) {L=6; M=20*2^L; A=vector(2^L); P=vector(M); A[1]=3; P[1]=1; for(i=1, L, for(n=2^(i-1)+1, 2^i, for(m=1, M, q=A[n-2^(i-1)]+(2*m-1)*2^i; if(isprime(q)&P[q]==0, A[n]=q; P[q]=1; next(2)) )))}
|
|
CROSSREFS
|
Cf. A099864.
Sequence in context: A132445 A070846 A078683 this_sequence A031441 A078150 A114265
Adjacent sequences: A099860 A099861 A099862 this_sequence A099864 A099865 A099866
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Paul D. Hanna (pauldhanna(AT)juno.com), Oct 27 2004
|
|
|
Search completed in 0.002 seconds
|
