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.

A163622 Composite numbers such that the sum of its smallest digit and the largest digit is a prime.

Original entry on oeis.org

12, 14, 16, 20, 21, 25, 30, 32, 34, 38, 49, 50, 52, 56, 58, 65, 70, 74, 76, 85, 92, 94, 98, 102, 105, 112, 114, 116, 120, 121, 122, 124, 126, 130, 134, 136, 141, 142, 143, 144, 146, 150, 156, 161, 162, 164, 165, 166, 170, 200, 201, 202, 203, 205, 207, 210
Offset: 1

Views

Author

Parthasarathy Nambi, Aug 01 2009

Keywords

Comments

Numbers like 111 are ignored, at least two different digits are required.

Examples

			166 is a composite number whose sum of smallest digit and the largest digit is a prime.
		

Crossrefs

Programs

  • Mathematica
    comprQ[n_]:=Module[{idn=IntegerDigits[n]},CompositeQ[n]&&Length[Union[ idn]]>1&&PrimeQ[Min[idn]+Max[idn]]]; Select[Range[250],comprQ] (* Harvey P. Dale, Mar 29 2015 *)
  • Python
    from sympy import isprime
    def ok(n):
        digits = list(map(int, str(n)))
        repdigit, smlg = len(set(digits)) == 1, min(digits) + max(digits)
        return not repdigit and isprime(smlg) and not isprime(n)
    print([k for k in range(211) if ok(k)]) # Michael S. Branicky, Dec 14 2021

Extensions

Corrected and extended by Harvey P. Dale, Mar 29 2015
Showing 1-1 of 1 results.