|
Search: id:A062347
|
|
|
| A062347 |
|
a(n) = (product of first n primes) modulo prime(n+1). |
|
+0
5
|
|
| 1, 2, 1, 2, 1, 9, 8, 18, 15, 17, 19, 11, 6, 26, 35, 27, 15, 55, 30, 24, 28, 4, 47, 56, 28, 28, 75, 25, 105, 30, 9, 52, 111, 89, 46, 132, 53, 97, 104, 106, 42, 94, 158, 184, 155, 5, 6, 45, 87, 78, 86, 26, 120, 33, 242, 66, 86, 2, 214, 2, 198, 127, 14, 112, 7, 141, 77, 309
(list; graph; listen)
|
|
|
OFFSET
|
0,2
|
|
|
LINKS
|
Harry J. Smith, Table of n, a(n) for n=0,...,1000
|
|
FORMULA
|
a(n) = A051126(A002110(n), A000040(n-1))
|
|
EXAMPLE
|
a(4)=1 since 2*3*5*7 = 210 = 19*11 + 1
|
|
MATHEMATICA
|
Mod[ #[ [ 1 ] ], #[ [ 2 ] ] ]&/@ Transpose[ {FoldList[ Times, 1, Prime[ Range[ 70 ] ] ], Prime[ Range[ 71 ] ]} ]
|
|
PROGRAM
|
(PARI) { n=-1; f=1; forprime (p=2, prime(1001), write("b062347.txt", n++, " ", f%p); f*=p ) } [From Harry J. Smith (hjsmithh(AT)sbcglobal.net), Aug 05 2009]
|
|
CROSSREFS
|
Cf. A102647.
Sequence in context: A146003 A066772 A104060 this_sequence A124781 A124151 A110179
Adjacent sequences: A062344 A062345 A062346 this_sequence A062348 A062349 A062350
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Henry Bottomley (se16(AT)btinternet.com), Jul 06 2001
|
|
|
Search completed in 0.002 seconds
|
