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 A139049 #16 May 07 2025 17:14:57 %S A139049 8,9,11,13,17,19,23,25,29,35,37,43,47,49,53,59,65,67,73,77,79,85,89, %T A139049 95,103,107,109,113,115,119,133,137,143,145,155,157,163,169,173,179, %U A139049 185,187,197,199,203,205,217,229,233,235,239,245,247,257,263,269,275,277 %N A139049 a(n) = prime(n) + 6. %C A139049 a(n) = A000040(n) + 6 = A008864(n) + 5 = A052147(n) + 4 = A113395(n) + 3 = A175221(n) + 2 = A175222(n) + 1 = A175223(n) - 1 = A175224(n) - 2 = A140353(n) - 3 = A175225(n) - 4. - _Jaroslav Krizek_, Mar 06 2010 %H A139049 G. C. Greubel, <a href="/A139049/b139049.txt">Table of n, a(n) for n = 1..10000</a> %p A139049 A139049:=n->ithprime(n)+6: seq(A139049(n), n=1..100); # _Wesley Ivan Hurt_, Apr 18 2017 %t A139049 6+Prime[Range[70]] (* _G. C. Greubel_, May 20 2019 *) %o A139049 (PARI) A139049(n) = prime(n)+6 %o A139049 (Magma) [NthPrime(n)+6: n in [1..70]]; // _G. C. Greubel_, May 20 2019 %o A139049 (Sage) [nth_prime(n) +6 for n in (1..70)] # _G. C. Greubel_, May 20 2019 %o A139049 (GAP) Filtered([1..300], k-> IsPrime(k) ) + 6; # _G. C. Greubel_, May 20 2019 %Y A139049 Cf. A140353. %K A139049 easy,nonn %O A139049 1,1 %A A139049 _Odimar Fabeny_, Jun 02 2008 %E A139049 Edited by _Michael B. Porter_, Jan 28 2010