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.

A090119 a(n) = nextprime(A090117(n)), the smallest prime following squares listed in A090117 and also the distance of a(n) from the preceding prime is 2*n.

This page as a plain text file.
%I A090119 #18 Jun 23 2025 10:24:19
%S A090119 5,11,29,367,149,631,127,1949,541,907,3251,1693,2503,10427,5779,10831,
%T A090119 10007,22229,30631,25301,121123,76207,93047,157627,212557,35729,
%U A090119 119027,1121509,190979,672439,693943,1004027,259099,1646101,675713,1207841
%N A090119 a(n) = nextprime(A090117(n)), the smallest prime following squares listed in A090117 and also the distance of a(n) from the preceding prime is 2*n.
%F A090119 a(n) = nextprime(A090117(n)) = nextprime(A090116(n)^2).
%F A090119 a(n) = A007918(A090117(n)) = prime(1+pi(A090117(n))).
%e A090119 a(7) = 127 because 127-113 = 14 = 2*7 and 121 = 11^2 is between {127,113} closest primes to 121 a suitable square number. Also 127 is the smallest prime with this property.
%t A090119 pre[x_] := Prime[PrimePi[x]]; nex[x_] := Prime[PrimePi[x]+1]; de[x_] := Prime[PrimePi[x]+1]-Prime[PrimePi[x]]; de[1] = 0; t=Table[de[w^2], {w, 1, 50000}]; mt=Table[Min[Flatten[Position[t, 2*j]]], {j, 1, 100}]; Table[nex[Part[mt, j]^2], {j, 1, Length[mt]}]
%Y A090119 Cf. A090116, A090117, A090118, A007917, A007918, A000720, A000040, A053001, A007491, A000290.
%K A090119 nonn
%O A090119 1,1
%A A090119 _Labos Elemer_, Jan 09 2004
%E A090119 Name corrected by _Jason Yuen_, Jun 23 2025