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.

A109652 a(n) = prime(A000201(n)).

This page as a plain text file.
%I A109652 #23 Aug 12 2023 05:15:04
%S A109652 2,5,7,13,19,23,31,37,43,53,59,67,73,79,89,97,103,109,113,131,137,149,
%T A109652 157,163,173,181,191,197,199,223,229,233,241,257,263,271,277,283,307,
%U A109652 311,317,331,347,353,359,373,383,389,401,409,421,433,439,449,457,463
%N A109652 a(n) = prime(A000201(n)).
%F A109652 a(n) ~ phi*n*log n, where phi = (1+sqrt(5))/2. - _Charles R Greathouse IV_, Apr 19 2015
%o A109652 (PARI) a(n) = prime(n*(1+sqrt(5))\2); \\ _Michel Marcus_, Aug 28 2013
%o A109652 (Python)
%o A109652 from math import isqrt
%o A109652 from sympy import prime
%o A109652 def A109652(n): return prime(n+isqrt(5*n**2)>>1) # _Chai Wah Wu_, Aug 10 2022
%Y A109652 Cf. A003849, A000201, A000040.
%K A109652 nonn,less
%O A109652 1,1
%A A109652 _E.J.P. Vening_, Aug 05 2005
%E A109652 Better description from Joseph Biberstine and _Graeme McRae_, Aug 05 2006