cp's OEIS Frontend

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.

A085416 Take prime[n] and continue adding 1,2,..., A085415(n) until one reaches a prime a(n).

Original entry on oeis.org

3, 13, 11, 13, 17, 19, 23, 29, 29, 107, 37, 43, 47, 53, 53, 59, 137, 67, 73, 107, 79, 89, 89, 167, 103, 107, 109, 113, 137, 149, 137, 137, 173, 149, 227, 157, 163, 173, 173, 179, 257, 191, 197, 199, 233, 227, 239, 229, 233, 239, 239, 317, 251, 257, 263, 269, 347
Offset: 1

Views

Author

Zak Seidov, Jun 29 2003

Keywords

Comments

Primes resulting in procedure of A085415. See also A085417, A085418.

Examples

			a(2)=13 because prime[2]=3 and 3+(1+2+3+4)=3+10=13 is a prime.
		

Crossrefs

Programs

  • Mathematica
    Table[SelectFirst[Prime[n]+Accumulate[Range[20]],PrimeQ],{n,60}] (* Requires Mathematica version 10 or later *) (* Harvey P. Dale, Aug 11 2019 *)