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 A110896 #35 Jul 04 2024 03:34:33
%S A110896 27,512,7378,96810,1194980,14186154,163938810,1858650070,20763688746,
%T A110896 229296037134,2508629501894,27235496973316,293784284670498,
%U A110896 3151605249578196,33649122286540910,357782405858669892,3790389667563960340,40026493653364473662,421463674881774896218
%N A110896 Difference between prime(10^n) and prime(10^(n-1)).
%H A110896 Amiram Eldar, <a href="/A110896/b110896.txt">Table of n, a(n) for n = 1..24</a>
%F A110896 a(n) = A006988(n) - A006988(n-1) = prime(10^n) - prime(10^(n-1)). - _Marvin Ray Burns_, Dec 09 2007; corrected by _Michel Marcus_, Jun 22 2022
%e A110896 The (10^1)th prime is 29. The (10^0)th prime is 2 and the difference is 27 the first entry.
%t A110896 Table[Prime[10^n] - Prime[10^(n - 1)], {n, 1, 12}] (* _Marvin Ray Burns_, Dec 09 2007 *)
%t A110896 Differences[Table[Prime[10^n],{n,0,12}]] (* _Harvey P. Dale_, Jul 03 2017 *)
%o A110896 (PARI) a(n) = prime(10^n) - prime(10^(n-1)); \\ _Jinyuan Wang_, Nov 14 2020; adapted to offset by _Georg Fischer_, Jun 22 2022
%o A110896 (Python)
%o A110896 from sympy import prime
%o A110896 def a(n): return prime(10**n)-prime(10**(n-1))
%o A110896 print([a(n) for n in range(1, 10)]) # _Michael S. Branicky_, Jun 22 2022
%Y A110896 Cf. A000040, A006988, A135371, A135373.
%K A110896 nonn
%O A110896 1,1
%A A110896 _Cino Hilliard_, Sep 20 2005
%E A110896 Corrected and extended by _Marvin Ray Burns_, Dec 09 2007
%E A110896 More terms from _Jinyuan Wang_, Nov 14 2020