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.

Showing 1-3 of 3 results.

A241528 Primes p such that p + 1234567890 is also prime where 1234567890 is the first pandigital number with digits in order.

Original entry on oeis.org

17, 23, 37, 59, 131, 139, 157, 199, 241, 311, 353, 359, 397, 433, 479, 547, 673, 691, 769, 877, 937, 947, 953, 1051, 1091, 1097, 1181, 1297, 1301, 1409, 1451, 1471, 1489, 1531, 1609, 1619, 1697, 1709, 1861, 1879, 1889, 1913, 1951, 2053, 2063, 2089, 2099, 2113
Offset: 1

Views

Author

K. D. Bajpai, Apr 25 2014

Keywords

Examples

			17 is prime and appears in the sequence because 17 + 1234567890 = 1234567907, which is also prime.
23 is prime and appears in the sequence because 23 + 1234567890 = 1234567913, which is also prime.
19 is prime but not included in the sequence since 19 + 1234567890 = 1234567909 = (59107)*(20887), which is not prime.

Links

Crossrefs

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

Programs

  • Maple
    KD := proc() local a,k; k:=ithprime(n);a:=k+1234567890; if isprime(a) then RETURN (k); fi; end: seq(KD(), n=1..1000);
  • Mathematica
    lst={}; Do[p=Prime[n]; If[PrimeQ[p+1234567890], AppendTo[lst,p]],{n,1,1000}]; lst
(* For the b-file *)  c=0; k=Prime[n]; a=k+1234567890; Do[If[PrimeQ[a], c++; Print[c," ",k]],{n,1,10^5}]
Select[Prime[Range[400]],PrimeQ[#+1234567890]&] (* Harvey P. Dale, Nov 18 2021 *)
  • PARI
    s=[]; forprime(p=2, 3000, if(isprime(p+1234567890), s=concat(s, p))); s \\ Colin Barker, Apr 25 2014

A241537 Cubes c such that c + 1234567890 is prime where 1234567890 is the first pandigital number with digits in order.

Original entry on oeis.org

1, 50653, 79507, 456533, 571787, 1295029, 1685159, 1771561, 2248091, 2685619, 3307949, 4173281, 7880599, 9393931, 10218313, 10793861, 11697083, 17373979, 18191447, 22665187, 30664297, 47045881, 70444997, 111284641, 146363183, 151419437, 156590819, 192100033
Offset: 1

Views

Author

K. D. Bajpai, Apr 25 2014

Keywords

Examples

			50653 = 37^3 and appears in the sequence because 50653 + 1234567890 = 1234618543, which is prime.
79507 = 43^3  and appears in the sequence because 79507 + 1234567890 = 1234647397, which is prime.
64000 = 40^3 but not included in the sequence since 64000 + 1234567890 = 1234631890 = (2)*(5)*(29389)*(4201), which is not prime.

Links

Crossrefs

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

Programs

  • Maple
    KD := proc() local a,c; c:=n^3;a:=c+1234567890; if isprime(a) then RETURN (c); fi; end: seq(KD(), n=1..1000);
  • Mathematica
    lst={}; Do[c=n^3; If[PrimeQ[c+1234567890], AppendTo[lst,c]], {n,1,1000}]; lst
(*For the b-file*)  m=0; c=n^3; a=c+1234567890; Do[If[PrimeQ[a],m++; Print[m," ",c]], {n,1,4*10^5}]
  • PARI
    s=[]; for(n=1, 1000, c=n^3; if(isprime(c+1234567890), s=concat(s, c))); s \\ Colin Barker, Apr 25 2014

A241538 Squares s such that s + 1234567890 is prime.

Original entry on oeis.org

1, 169, 1681, 6889, 8281, 11881, 24649, 27889, 41209, 57121, 58081, 67081, 80089, 101761, 124609, 175561, 185761, 201601, 212521, 332929, 380689, 413449, 461041, 508369, 534361, 609961, 625681, 654481, 683929, 693889, 822649, 829921, 833569, 1014049, 1018081
Offset: 1

Views

Author

K. D. Bajpai, Apr 25 2014

Keywords

Comments

1234567890 is the first pandigital number with digits in order.

Examples

			169 = 13^2 and appears in the sequence because 169 + 1234567890 = 1234568059, which is prime.
1681 = 41^2  and appears in the sequence because 1681 + 1234567890 = 1234569571, which is prime.
625 = 25^2 but is not included in the sequence since 625 + 1234567890 = 1234568515 = (5)*(246913703), which is not prime.

Links

Crossrefs

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

Programs

  • Maple
    KD := proc() local a,s; s:=n^2;a:=s+1234567890; if isprime(a) then RETURN (s); fi; end: seq(KD(), n=1..2000);
  • Mathematica
    A241538 = {}; Do[s = n^2; If[PrimeQ[s + 1234567890], AppendTo[A241538, s]], {n, 2000}]; A241538
(* 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 *)
Select[Range[1000]^2, PrimeQ[# + 1234567890] &] (* Alonso del Arte, Apr 25 2014 *)
Showing 1-3 of 3 results.

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.