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 A140353 #10 Sep 08 2022 08:45:34 %S A140353 11,12,14,16,20,22,26,28,32,38,40,46,50,52,56,62,68,70,76,80,82,88,92, %T A140353 98,106,110,112,116,118,122,136,140,146,148,158,160,166,172,176,182, %U A140353 188,190,200,202,206,208,220,232,236,238,242,248,250,260,266,272,278,280,286 %N A140353 a(n) = prime(n) + 9. %C A140353 a(n) = A000040(n) + 9 = A008864(n) + 8 = A052147(n) + 7 = A113395(n) + 6 = A175221(n) + 5 = A175222(n) + 4 = A139049(n) + 3 = A175223(n) + 2 = A175224(n) + 1 = A175225(n) - 1. - _Jaroslav Krizek_, Mar 06 2010 %H A140353 G. C. Greubel, <a href="/A140353/b140353.txt">Table of n, a(n) for n = 1..10000</a> %t A140353 9 + Prime[Range[70]] (* _G. C. Greubel_, May 20 2019 *) %o A140353 (PARI) A140353(n) = prime(n)+9 %o A140353 (Magma) [NthPrime(n)+9: n in [1..70]]; // _G. C. Greubel_, May 20 2019 %o A140353 (Sage) [nth_prime(n) +9 for n in (1..70)] # _G. C. Greubel_, May 20 2019 %o A140353 (GAP) Filtered([1..300], k-> IsPrime(k) ) +9 # _G. C. Greubel_, May 20 2019 %Y A140353 Cf. A139049 %K A140353 easy,nonn %O A140353 1,1 %A A140353 _Odimar Fabeny_, May 30 2008 %E A140353 Edited by _Michael B. Porter_, Jan 28 2010