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.

Previous Showing 11-12 of 12 results.

A028866 Squares of primes having digits in nondecreasing order.

Original entry on oeis.org

4, 9, 25, 49, 169, 289, 1369, 4489, 6889, 11449, 27889, 113569, 134689, 146689, 344569, 2778889, 27777888889, 111113555569, 111133556689, 111333666889, 113344668889, 444444888889, 1111133355666889, 1133444466888889
Offset: 1

Views

Author

Keywords

Comments

What is the rate of growth of this sequence?

Crossrefs

Subsequence of A052043.

Programs

  • Mathematica
    Select[Prime[Range[100]]^2, IntegerDigits[#] == Sort[IntegerDigits[#]] &] (* Alonso del Arte, Jan 18 2017 *)
  • PARI
    is(n)=my(d=digits(n));d==vecsort(d) && issquare(n,&n) && isprime(n) \\ Charles R Greathouse IV, Jun 05 2013

Extensions

Title changed to reflect terms by Sean A. Irvine, Feb 12 2020

A245576 Primes p such that p and p^2 lack the zero digit in their decimal expansions.

Original entry on oeis.org

2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 59, 61, 67, 73, 79, 83, 89, 113, 127, 131, 137, 139, 157, 163, 167, 173, 181, 191, 193, 211, 223, 227, 229, 233, 239, 263, 269, 271, 277, 281, 293, 311, 313, 337, 359, 367, 373, 379, 383, 389, 419, 421, 431, 433
Offset: 1

Views

Author

Zak Seidov, Dec 25 2014

Keywords

Comments

Subsequence of A052042. First terms that are in A052042 but not here: 107, 109, 307, 409.

Crossrefs

Programs

  • Mathematica
    fQ[n_] := Min[IntegerDigits[n]] > 0; Select[Prime @ Range @ 90, fQ[#] && fQ[#^2] &]
    Select[Prime[Range[100]],FreeQ[{IntegerDigits[#],IntegerDigits[#^2]},0]&] (* Harvey P. Dale, Jun 14 2024 *)
  • PARI
    (vmd (n) = vecmin (digits (n))); p = 2;for (k = 1, 300, if (vmd (p) > 0 && vmd (p^2) > 0, print1 (p ", " )); p = nextprime (1 + p))
    
  • Python
    from sympy import prime
    A245576_list = [p for p in (prime(i) for i in range(1,10**4)) if not(str(p).count('0') or str(p**2).count('0'))]
    # Chai Wah Wu, Dec 27 2014
Previous Showing 11-12 of 12 results.