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.
A000040(471) ....... = 3343 A000040(3570) ...... = 33343 A000040(28674) ..... = 333433 A000040(28743) ..... = 334333 A000040(13077233344) = 333333433343
[p: p in [3..33333333343 by 10] | (p mod 100 eq 33 or p mod 100 eq 43) and IsPrime(p) and Position(IntegerToString(p), IntegerToString(3)) eq 1 and Set(Intseq(p)) subset [3, 4] and not IntegerToString(44) in IntegerToString(p)];
S:= {}:
for n from 3 to 16 do
for k from 1 to floor((n-1)/2) do
for r in combinat:-choose(n-1-k,k) do
L:=subsop(seq(t=(3,4),t=r),[3$(n-k)]);
x:= add(L[i]*10^(n-i),i=1..n);
if isprime(x) then S:= S union {x} fi
od od od:
sort(convert(S,list)); # Robert Israel, Mar 15 2016
Select[Flatten[Table[FromDigits/@Select[Tuples[{3,4},n],SequenceCount[ #,{3,4,3},Overlaps->True]==Count[#,4]&],{n,3,11}]],PrimeQ]//Sort (* Requires Mathematica version 10 or later *) (* Harvey P. Dale, Sep 17 2016 *)
[p: p in PrimesUpTo(10^6) | Set(Intseq(p)) subset [0, 1, 2, 5, 6, 7, 8, 9]];
f:= n-> (l-> add([$0..2, $5..9][l[j]+1]*10^(j-1), j=1..nops(l)))(convert(n, base, 8)): select(isprime, [seq(f(i), i=0..600)])[]; # Alois P. Heinz, Jul 19 2025
Select[Prime[Range[120]], DigitCount[#, 10, 3] == 0 && DigitCount[#, 10, 4] == 0 &]
primes_with(, 1, [0, 1, 2, 5, 6, 7, 8, 9]) \\ uses function in A385776
print(list(islice(primes_with("01256789"), 41))) # uses function/imports in A385776
Comments