|
Search: id:A088227
|
|
|
| A088227 |
|
Solutions x to x^n == 7 mod 13. |
|
+0
1
|
|
| 2, 6, 7, 11, 15, 19, 20, 24, 28, 32, 33, 37, 41, 45, 46, 50, 54, 58, 59, 63, 67, 71, 72, 76, 80, 84, 85, 89, 93, 97, 98, 102, 106, 110, 111, 115, 119, 123, 124, 128, 132, 136, 137, 141, 145, 149, 150, 154, 158, 162, 163, 167, 171, 175, 176, 180, 184, 188, 189, 193
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
COMMENT
|
Primitive roots of 13. The first diffrences are periodic: 4,1,4,4,4,1,4,4,4,1,4,4... - Paolo P. Lava (ppl(AT)spl.at), Feb 29 2008
|
|
REFERENCES
|
E. Grosswald, Topics From The Theory of Numbers, 1966, pp. 62-63.
|
|
FORMULA
|
a(n)=-6+Sum_{k=0..n}{(1/24)*[ -5*(k mod 4)+31*((k+1) mod 4)+13*((k+2) mod 4)+13*((k+3) mod 4)]}, with n>=1 - Paolo P. Lava (ppl(AT)spl.at), Feb 29 2008
|
|
EXAMPLE
|
2^11 - 7 = 2041 = 11*157. Thus 2 is in the sequence.
|
|
PROGRAM
|
(PARI) conxkmap(a, p, n) = { for(x=1, n, for(j=1, n, y=x^j-a; if(y%p==0, print1(x", "); break) ) ) }
|
|
CROSSREFS
|
Sequence in context: A047216 A039568 A032926 this_sequence A145489 A051678 A079906
Adjacent sequences: A088224 A088225 A088226 this_sequence A088228 A088229 A088230
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Cino Hilliard (hillcino368(AT)gmail.com), Nov 03 2003
|
|
|
Search completed in 0.002 seconds
|
