Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A062347
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
%I A062347
%S A062347 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,
%T A062347 75,25,105,30,9,52,111,89,46,132,53,97,104,106,42,94,158,184,155,5,6,
%U A062347 45,87,78,86,26,120,33,242,66,86,2,214,2,198,127,14,112,7,141,77,309
%N A062347 a(n) = (product of first n primes) modulo prime(n+1).
%H A062347 Harry J. Smith, <a href="b062347.txt">Table of n, a(n) for n=0,...,1000</
               a>
%F A062347 a(n) = A051126(A002110(n), A000040(n-1))
%e A062347 a(4)=1 since 2*3*5*7 = 210 = 19*11 + 1
%t A062347 Mod[ #[ [ 1 ] ], #[ [ 2 ] ] ]&/@ Transpose[ {FoldList[ Times, 1, Prime[ 
               Range[ 70 ] ] ], Prime[ Range[ 71 ] ]} ]
%o A062347 (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]
%Y A062347 Cf. A102647.
%Y A062347 Sequence in context: A146003 A066772 A104060 this_sequence A124781 A124151 
               A110179
%Y A062347 Adjacent sequences: A062344 A062345 A062346 this_sequence A062348 A062349 
               A062350
%K A062347 nonn
%O A062347 0,2
%A A062347 Henry Bottomley (se16(AT)btinternet.com), Jul 06 2001

    
page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified November 27 14:50 EST 2009. Contains 167570 sequences.


AT&T Labs Research