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-1 of 1 results.

A235108 Semiprimes with digits in strictly decreasing order.

Original entry on oeis.org

4, 6, 9, 10, 21, 51, 62, 65, 74, 82, 85, 86, 87, 91, 93, 94, 95, 321, 542, 543, 721, 731, 753, 763, 831, 841, 842, 843, 851, 862, 865, 871, 921, 943, 951, 961, 965, 973, 974, 982, 985, 4321, 5321, 6431, 6541, 6542, 7421, 7431, 7531, 7543, 7631, 7642, 7651
Offset: 1

Views

Author

Colin Barker, Jan 03 2014

Keywords

Crossrefs

Programs

  • Maple
    b:= proc(n) n, seq(b(10*n+j), j=irem(n, 10)-1..0, -1) end:
    select(numtheory[bigomega]=2, {seq(b(n), n=1..9)})[];  # Alois P. Heinz, Apr 13 2025
  • Mathematica
    Select[Range[10000],PrimeOmega[#]==2&&Max[Differences[IntegerDigits[#]]]<0&] (* Harvey P. Dale, Aug 18 2024 *)
  • PARI
    list(lim)=my(v=List(), t); forprime(p=2, sqrt(lim), t=p; forprime(q=p, lim\t, listput(v, t*q))); vecsort(Vec(v)) \\ From A001358
    isdecr(a) = {my(b=-1); until(a==0, if(a%10<=b, return(0)); b=a%10; a\=10); return(1)}
    u=list(50000); s=[]; for(n=1, #u, if(isdecr(u[n]), s=concat(s, u[n]))); s
Showing 1-1 of 1 results.