Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
editing
approved
Harvey P. Dale, <a href="/A095245/b095245.txt">Table of n, a(n) for n = 0..1000</a>
approved
editing
editing
approved
Table[Mod[FromDigits[Flatten[IntegerDigits/@Prime[Range[n]]]], Prime[n]], {n, 60}] (* Harvey P. Dale, May 30 2018 *)
approved
editing
_Amarnath Murthy (amarnath_murthy(AT)yahoo.com), _, Jun 17 2004
Edited, corrected and extended by _Stefan Steinerberger (stefan.steinerberger(AT)gmail.com), _, Jun 26 2007
(Concatenation of first n primes mod () modulo prime(n)) = 0.
0, 2, 0, 5, 3, 7, 15, 16, 21, 27, 7, 11, 17, 21, 37, 7, 28, 10, 50, 70, 70, 23, 46, 20, 76, 93, 81, 52, 1, 58, 87, 54, 100, 128, 39, 10, 117, 16, 42, 89, 98, 61, 135, 123, 13, 89, 201, 147, 124, 176, 186, 202, 71, 74, 256, 228, 137, 84, 145
1,0,2
The concatenation of the first 3 primes is 235. The third prime is 5. Therefore a(3) = 235 mod 5 = 0.
a = {2}; b = {0}; For[n = 2, n < 100, n++, a = Flatten[Join[a, IntegerDigits[ Prime[n]]] ]; AppendTo[b, Mod[FromDigits[a], Prime[n]]]]; b
base,more,nonn,uned,newless
Edited, corrected and extended by Stefan Steinerberger (stefan.steinerberger(AT)gmail.com), Jun 26 2007
base,more,nonn,uned,new
Warning: Many recent communications from this author have contained numerical errors or have been badly formatted. This entry has not been edited and may contain errors. It is included on a provisional basis in the hope that some reader will edit it. - njas
Concatenation of first n primes mod (prime(n)) = 0.
0, 2, 0, 5, 3, 7, 15, 16, 21, 27
1,2
base,more,nonn,uned
Amarnath Murthy (amarnath_murthy(AT)yahoo.com), Jun 17 2004
Warning: Many recent communications from this author have contained numerical errors or have been badly formatted. This entry has not been edited and may contain errors. It is included on a provisional basis in the hope that some reader will edit it. - njas
approved