Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A075306
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
%I A075306
%S A075306 3,25,91,2101,23101,60061,510511,29099071,3792578791,84106011991,
%T A075306 2005604901301,252305096583541,11561510014033981,52331045326680121,
%U A075306 31359378912013061911,1792403716245452460151,98060777857864844592571
%N A075306 Smallest number == 0 mod (n+1)-th prime and == 1 mod all smaller primes.
%e A075306 a(4) = 2101 == 0 mod 11 and 2101 == 1 mod (2*3*5*7)
%o A075306 (PARI) for(n=1,20,p=1:forprime(k=2, prime(n),p=p*k):pn=prime(n+1):s=0:while((s+1)%pn>
               0,s=s+p):print1(s+1","))
%Y A075306 Sequence in context: A083222 A041565 A114378 this_sequence A124245 A059457 
               A165206
%Y A075306 Adjacent sequences: A075303 A075304 A075305 this_sequence A075307 A075308 
               A075309
%K A075306 nonn
%O A075306 1,1
%A A075306 Amarnath Murthy (amarnath_murthy(AT)yahoo.com), Sep 13 2002
%E A075306 More terms from Ralf Stephan (ralf(AT)ark.in-berlin.de), Mar 24 2003

    
page 1

Search completed in 0.001 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 December 20 00:58 EST 2009. Contains 171054 sequences.


AT&T Labs Research