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

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A243895 a(n) = prime(n^2-1). 2
5, 19, 47, 89, 149, 223, 307, 409, 523, 659, 823, 997, 1187, 1423, 1613, 1877, 2141, 2423, 2731, 3079, 3457, 3797, 4201, 4621, 5039, 5507, 5987, 6473, 6991, 7561, 8147, 8731, 9337, 9929, 10613, 11317, 12043, 12739, 13487, 14323, 15091, 15859, 16741 (list; graph; refs; listen; history; text; internal format)
OFFSET
2,1
COMMENTS
The prime numbers prime(k-1), prime(k) = A001248 and prime(k+1) = A243896 with k = n^2 are building a triple of successive prime numbers. Remark: prime(n^2-1) is not defined for n=1.
LINKS
FORMULA
a(n) = prime(n^2-1) = prime(A000290(n) - 1) = prime(A005563(n-1)).
EXAMPLE
n = 3, n^2 = 9, n^2-1 = 8, prime(8) = 19.
CROSSREFS
Cf. A000290 (squares n^2), A000040 (prime(n)), A001248 (prime(n)^2), A011757 (prime(n^2)), A055875 (prime(n^3)), A096327 (prime((prime(n)^2))), A096328 (prime(prime(n)^3)), A038580 (prime(prime(prime(n)))).
Sequence in context: A176358 A045458 A120289 * A024191 A277801 A328191
KEYWORD
nonn
AUTHOR
Freimut Marschner, Jun 17 2014
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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 24 09:41 EDT 2024. Contains 371935 sequences. (Running on oeis4.)