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 A052147 #58 Mar 13 2025 13:28:25 %S A052147 4,5,7,9,13,15,19,21,25,31,33,39,43,45,49,55,61,63,69,73,75,81,85,91, %T A052147 99,103,105,109,111,115,129,133,139,141,151,153,159,165,169,175,181, %U A052147 183,193,195,199,201,213,225,229,231,235,241,243,253,259 %N A052147 a(n) = prime(n) + 2. %C A052147 A048974, A052147, A067187 and A088685 are very similar after dropping terms less than 13. - _Eric W. Weisstein_, Oct 10 2003 %C A052147 A117530(n,2) = a(n) for n>1. - _Reinhard Zumkeller_, Mar 26 2006 %C A052147 a(n) = A000040(n) + 2 = A008864(n) + 1 = A113395(n) - 1 = A175221(n) - 2 = A175222(n) - 3 = A139049(n) - 4 = A175223(n) - 5 = A175224(n) - 6 = A140353(n) - 7 = A175225(n) - 8. - _Jaroslav Krizek_, Mar 06 2010 %C A052147 Left edge of the triangle in A065342. - _Reinhard Zumkeller_, Jan 30 2012 %C A052147 Union of A006512 and A107986. - _David James Sycamore_, Jul 08 2018 %H A052147 Vincenzo Librandi, <a href="/A052147/b052147.txt">Table of n, a(n) for n = 1..1000</a> %p A052147 seq(ithprime(n)+2,n=1..55); # _Muniru A Asiru_, Jul 08 2018 %t A052147 Prime[Range[70]]+2 (* _Vladimir Joseph Stephan Orlovsky_, Apr 29 2008 *) %o A052147 (Magma) [p+2: p in PrimesUpTo(400)]; // _Vincenzo Librandi_, Nov 27 2013 %o A052147 (Haskell) %o A052147 a052147 = (+ 2) . a000040 -- _Reinhard Zumkeller_, Jul 03 2015 %o A052147 (PARI) a(n)=prime(n)+2 \\ _Charles R Greathouse IV_, Jan 19 2017 %o A052147 (Sage) [nth_prime(n) +2 for n in (1..70)] # _G. C. Greubel_, May 20 2019 %o A052147 (GAP) Filtered([1..300], k-> IsPrime(k) ) + 2; # _G. C. Greubel_, May 20 2019 %Y A052147 A139690 is a subsequence. %Y A052147 Cf. A040976, A000040. %K A052147 nonn,easy %O A052147 1,1 %A A052147 Simon Colton (simonco(AT)cs.york.ac.uk), Jan 24 2000