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!)
A109652 a(n) = prime(A000201(n)). 2

%I #23 Aug 12 2023 05:15:04

%S 2,5,7,13,19,23,31,37,43,53,59,67,73,79,89,97,103,109,113,131,137,149,

%T 157,163,173,181,191,197,199,223,229,233,241,257,263,271,277,283,307,

%U 311,317,331,347,353,359,373,383,389,401,409,421,433,439,449,457,463

%N a(n) = prime(A000201(n)).

%F a(n) ~ phi*n*log n, where phi = (1+sqrt(5))/2. - _Charles R Greathouse IV_, Apr 19 2015

%o (PARI) a(n) = prime(n*(1+sqrt(5))\2); \\ _Michel Marcus_, Aug 28 2013

%o (Python)

%o from math import isqrt

%o from sympy import prime

%o def A109652(n): return prime(n+isqrt(5*n**2)>>1) # _Chai Wah Wu_, Aug 10 2022

%Y Cf. A003849, A000201, A000040.

%K nonn,less

%O 1,1

%A _E.J.P. Vening_, Aug 05 2005

%E Better description from Joseph Biberstine and _Graeme McRae_, Aug 05 2006

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 25 08:27 EDT 2024. Contains 371964 sequences. (Running on oeis4.)