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.

A176586 Primes of the form : n^3 + Largest square + Smallest square, (Largest square <= n^3, Smallest square >= n^3).

This page as a plain text file.
%I A176586 #8 Feb 22 2023 10:34:13
%S A176586 3,222601,2824933,3573761,4215749,5183821,6001997,6592613,7886597,
%T A176586 8592401,9725393,10127813,10531813,12751093,13720661,15263009,
%U A176586 18087529,30232597,52730113,68727469,79395353,109787269,139967461,162040453
%N A176586 Primes of the form : n^3 + Largest square + Smallest square, (Largest square <= n^3, Smallest square >= n^3).
%H A176586 Charles R Greathouse IV, <a href="/A176586/b176586.txt">Table of n, a(n) for n = 1..10000</a>
%t A176586 r[n_]:=n^3;f[n_]:=r[n]+Floor[Sqrt[r[n]]]^2+Ceiling[Sqrt[r[n]]]^2;Select[Table[f[n],{n,0,7!}],PrimeQ[ # ]&]
%t A176586 lsss[n_]:=Module[{c=n^3},c+Floor[Sqrt[c]]^2+Ceiling[Sqrt[c]]^2]; Select[Array[ lsss,1000],PrimeQ] (* _Harvey P. Dale_, Feb 22 2023 *)
%o A176586 (PARI) print1(3);for(n=2,1e3,t=sqrtint(n^3);if(isprime(t=n^3+t^2+ (t+1)^2) && !issquare(n),print1(", "t))) \\ _Charles R Greathouse IV_, Apr 15 2012
%Y A176586 Cf. A065733, A075847, A077116, A176580, A176581, A176582, A176583, A176584, A176585.
%K A176586 nonn
%O A176586 1,1
%A A176586 _Vladimir Joseph Stephan Orlovsky_, Apr 21 2010