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.

A382198 Smallest integer k with n distinct digits, such that for each digit of k, 2*k*(digit) + 1 is prime.

Original entry on oeis.org

3, 14, 153, 2169, 48165, 125769, 327174495
Offset: 1

Views

Author

Michel Marcus, Mar 18 2025

Keywords

Comments

See 1st comment of A382127 for an explanation that there cannot be more than 7 terms.

Crossrefs

Subsequence of A382179.

Programs

  • PARI
    isok(k, n) = my(d=Set(digits(k))); if (#d != n, return(0)); for (i=1, #d, if (!isprime(2*k*d[i]+1), return(0)); ); return(1);
    a(n) = my(k=2); while (!isok(k, n), k++); k;