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.
lista(nn) = {for(n=1, nn, if (isA132285(n) && isprime(p=n/11), print1(p, ", ");););} \\ Michel Marcus, Nov 05 2013
monQ[n_]:=Module[{len=IntegerLength[n],idn=IntegerDigits[n]},EvenQ[ len] &&Take[idn,len/2]==Reverse[Take[idn,-len/2]]]; Select[Range[11,9999,2], monQ] (* Harvey P. Dale, Apr 18 2014 *)
isok(n) = {if (n % 2 == 0, return (0)); d = digits(n); if (#d % 2 == 1, return (0)); for (i=1, #d/2, if (d[i] != d[#d-i+1], return (0));); return (1);} \\ Michel Marcus, Nov 05 2013
rev:= proc(n) local L,i; L:= convert(n,base,10); add(L[-i]*10^(i-1),i=1..nops(L)) end proc: f:= proc(m) local A,i,j,k; select(t -> isprime(t/11), [seq(seq(10^(m-1)*i + 10^(m/2)*j + rev(10^(m/2-1)*i+j),j=0 .. 10^(m/2-1)-1),i=[1,3,5,7, 9])]) end proc: seq(op(f(m)),m=2..6,2); # Robert Israel, Jan 05 2025
lista(nn) = {for(n=1, nn, if (ismo(n) && (bigomega(n) == 2), print1(n, ", ");););} \\ where ismo is isok in A132285 \\ Michel Marcus, Nov 05 2013
79 = emirp(7), 97 = emirp(8), 7997 / 11 = 727 = palprime(15) is first term 113 = emirp(10), 311 = emirp(16), 113311 / 11 = 10301 = palprime(21) is 2nd term 14303 = emirp(414), 30341 = emirp(639), 1430330341 / 11 = 130030031 = palprime(1229), 26th term
Comments