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.

A145445 a(n) = the smallest square > n-th prime.

This page as a plain text file.
%I A145445 #13 Apr 04 2021 08:51:00
%S A145445 4,4,9,9,16,16,25,25,25,36,36,49,49,49,49,64,64,64,81,81,81,81,100,
%T A145445 100,100,121,121,121,121,121,144,144,144,144,169,169,169,169,169,196,
%U A145445 196,196,196,196,225,225,225,225,256,256,256,256,256,256,289,289,289,289
%N A145445 a(n) = the smallest square > n-th prime.
%H A145445 Vincenzo Librandi, <a href="/A145445/b145445.txt">Table of n, a(n) for n = 1..1000</a>
%F A145445 a(n) = A104103(n)^2.
%t A145445 Table[Ceiling[Prime[n]^(1/2)]^2,{n,100}]
%o A145445 (Haskell)
%o A145445 a145445 n = a145445_list !! (n-1)
%o A145445 a145445_list = f a000040_list $ drop 2 a000290_list where
%o A145445    f ps'@ (p:ps) xs'@(x:xs) = if p < x then x : f ps xs' else f ps' xs
%o A145445 -- _Reinhard Zumkeller_, Jul 25 2014
%o A145445 (Python)
%o A145445 from sympy import prime, integer_nthroot
%o A145445 def a(n): return (integer_nthroot(prime(n), 2)[0]+1)**2
%o A145445 print([a(n) for n in range(1, 59)]) # _Michael S. Branicky_, Apr 04 2021
%Y A145445 Cf. A104103.
%Y A145445 Cf. A000040, A000290, A014085 (run lengths), A245508.
%K A145445 nonn
%O A145445 1,1
%A A145445 _Zak Seidov_, Oct 10 2008