The OEIS is supported by the many generous donors to the OEIS Foundation.

 Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 59th year, we have over 358,000 sequences, and we’ve crossed 10,300 citations (which often say “discovered thanks to the OEIS”). Other ways to Give
 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A256491 a(n) = prime(prime(n) + n - 2). 1
 2, 5, 13, 23, 43, 59, 79, 97, 113, 157, 173, 211, 239, 257, 281, 331, 373, 389, 433, 461, 479, 523, 569, 607, 659, 691, 719, 751, 769, 811, 911, 947, 997, 1019, 1091, 1103, 1163, 1217, 1249, 1297, 1361, 1381, 1459, 1483, 1511, 1543, 1619, 1723, 1759, 1787, 1831 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 COMMENTS All terms are prime. LINKS FORMULA a(n) = A256464(prime(n)). EXAMPLE a(3) = prime(prime(3) + 3 - 2) = prime(5 + 3 - 2) = prime(6) = 13. a(4) = prime(prime(4) + 4 - 2) = prime(7 + 4 - 2) = prime(9) = 23. a(5) = prime(prime(5) + 4 - 2) = prime(11 + 4 - 2) = prime(13) = 43. MATHEMATICA Table[Prime[Prime[n] + n - 2], {n, 51}] (* Jon Maiga, Nov 20 2018 *) PROG (PARI) a(n) = {i = prime(n); stop = 0; while (! stop, vab = vector(i, k, sigma(k)/k); w = vecsort(vab, , 1); pos = posv(n, w); if (pos == n, stop=1, i++); ); i; } CROSSREFS Cf. A256464. Sequence in context: A075470 A049779 A281906 * A106009 A194552 A079780 Adjacent sequences: A256488 A256489 A256490 * A256492 A256493 A256494 KEYWORD nonn AUTHOR Michel Marcus, Mar 30 2015 EXTENSIONS Name clarified by Alonso del Arte, Nov 20 2018, was "A256464(prime(n))." STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified December 1 03:09 EST 2022. Contains 358454 sequences. (Running on oeis4.)