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!)
A241538 Squares s such that s + 1234567890 is prime. 1

%I #13 May 03 2014 12:12:55

%S 1,169,1681,6889,8281,11881,24649,27889,41209,57121,58081,67081,80089,

%T 101761,124609,175561,185761,201601,212521,332929,380689,413449,

%U 461041,508369,534361,609961,625681,654481,683929,693889,822649,829921,833569,1014049,1018081

%N Squares s such that s + 1234567890 is prime.

%C 1234567890 is the first pandigital number with digits in order.

%H K. D. Bajpai, <a href="/A241538/b241538.txt">Table of n, a(n) for n = 1..10000</a>

%e 169 = 13^2 and appears in the sequence because 169 + 1234567890 = 1234568059, which is prime.

%e 1681 = 41^2 and appears in the sequence because 1681 + 1234567890 = 1234569571, which is prime.

%e 625 = 25^2 but is not included in the sequence since 625 + 1234567890 = 1234568515 = (5)*(246913703), which is not prime.

%p KD := proc() local a,s; s:=n^2;a:=s+1234567890; if isprime(a) then RETURN (s); fi; end: seq(KD(), n=1..2000);

%t A241538 = {}; Do[s = n^2; If[PrimeQ[s + 1234567890], AppendTo[A241538, s]], {n, 2000}]; A241538

%t (* For the b-file *) c = 0; s = n^2; a = s + 1234567890; Do[If[PrimeQ[a], c++; Print[c, " ", s]], {n, 4*10^5}] (* Bajpai *)

%t Select[Range[1000]^2, PrimeQ[# + 1234567890] &] (* _Alonso del Arte_, Apr 25 2014 *)

%Y Cf. A000040, A002496, A028871, A050289, A056899, A234812, A235640, A240587.

%K nonn,less

%O 1,2

%A _K. D. Bajpai_, Apr 25 2014

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 19 07:33 EDT 2024. Contains 371782 sequences. (Running on oeis4.)