This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A110923 #32 Dec 13 2024 10:24:24 %S A110923 2,3,5,7,11,13,17,19,23,29,31,37,41,43,47,53,59,61,67,71,73,79,83,89, %T A110923 97,1,3,7,9,13,27,31,37,39,49,51,57,63,67,73,79,81,91,93,97,99,11,23, %U A110923 27,29,33,39,41,51,57,63,69,71,77,81,83,93,7,11,13,17,31,37 %N A110923 Final two digits of prime(n), with leading zero omitted. %C A110923 Primes modulo 100. %H A110923 Nathaniel Johnston, <a href="/A110923/b110923.txt">Table of n, a(n) for n = 1..10000</a> %H A110923 <a href="/index/Fi#final">Index entries for sequences related to final digits of numbers</a>. %F A110923 Sum_k={1..n} a(k) ~ 50*n. - _Amiram Eldar_, Dec 13 2024 %p A110923 seq(ithprime(n) mod 100, n=1..100); # _Nathaniel Johnston_, Jun 29 2011 %t A110923 Table[Mod[Prime[n], 100], {n, 100}] (* _Ray Chandler_, Oct 01 2005 *) %t A110923 Mod[Prime[Range[100]], 100] (* _Vincenzo Librandi_, May 07 2014 *) %o A110923 (Sage) [mod(p, 100) for p in primes(500)] # _Bruno Berselli_, May 05 2014 %o A110923 (Magma) [p mod(100): p in PrimesUpTo(500)]; // _Vincenzo Librandi_, May 07 2014 %Y A110923 Cf. A007652, A242119. %K A110923 nonn,base,easy %O A110923 1,1 %A A110923 _Paolo P. Lava_, Sep 23 2005 %E A110923 Edited, corrected and extended by _Ray Chandler_, Oct 01 2005