|
Search: id:A064367
|
|
|
| A064367 |
|
a(n) = Mod[2^n,Prime[n]], or 2^n=k*p(n)+a(n), k is integer. |
|
+0
4
|
|
| 0, 1, 3, 2, 10, 12, 9, 9, 6, 9, 2, 26, 33, 1, 9, 28, 33, 27, 13, 48, 8, 36, 47, 4, 95, 20, 76, 62, 23, 4, 8, 117, 68, 25, 138, 64, 150, 43, 61, 10, 72, 156, 40, 12, 73, 51, 48, 41, 24, 26, 71, 48, 32, 16, 128, 173, 74, 110, 118, 59, 30, 247, 202, 208, 284, 53, 128, 32, 139
(list; graph; listen)
|
|
|
OFFSET
|
1,3
|
|
|
LINKS
|
Harry J. Smith, Table of n, a(n) for n=1,...,1000
|
|
FORMULA
|
a(n)=Mod[A000079(n), A000040(n)]
|
|
EXAMPLE
|
Below the exponent n<10000, some integers (like 5,7,14,17,19,22,..,44, etc) are not yet present among residues. Will they appear later?
|
|
PROGRAM
|
(PARI) { p=1; for (n=1, 1000, write("b064367.txt", n, " ", (p*=2) % prime(n)) ) } [From Harry J. Smith (hjsmithh(AT)sbcglobal.net), Sep 12 2009]
|
|
CROSSREFS
|
A000040, A000079, A015910.
Sequence in context: A056861 A103245 A019242 this_sequence A113980 A095675 A006743
Adjacent sequences: A064364 A064365 A064366 this_sequence A064368 A064369 A064370
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Labos E. (labos(AT)ana.sote.hu), Sep 27 2001
|
|
EXTENSIONS
|
Definition corrected by Harry J. Smith (hjsmithh(AT)sbcglobal.net), Sep 12 2009
|
|
|
Search completed in 0.002 seconds
|
