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.

A030088 a(n) = prime^2 and digits of prime do not appear in a(n).

Original entry on oeis.org

4, 9, 49, 289, 841, 2209, 2809, 3481, 4489, 6241, 24649, 29929, 66049, 94249, 97969, 121801, 124609, 128881, 167281, 201601, 218089, 299209, 310249, 332929, 434281, 452929, 458329, 546121, 619369, 727609, 863041, 2093809
Offset: 1

Views

Author

Keywords

Crossrefs

Cf. A030086.
Subsequence of A001248.

Programs

  • Maple
    R:= NULL: count:= 0: p:= 0:
    while count < 40 do
      p:= nextprime(p);
      ps:= p^2;
      if convert(convert(p,base,10),set) intersect convert(convert(ps,base,10),set) = {} then
        R:= R, ps; count:= count+1
      fi
    od:
    R; # Robert Israel, Nov 02 2022
  • Mathematica
    Select[Prime[Range[250]],Intersection[IntegerDigits[#],IntegerDigits[#^2]]=={}&]^2 (* Harvey P. Dale, May 18 2024 *)

Formula

a(n) = A030086(n)^2. - Robert Israel, Nov 02 2022