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 31-32 of 32 results.

A074101 Squares using no prime digit.

Original entry on oeis.org

0, 1, 4, 9, 16, 49, 64, 81, 100, 144, 169, 196, 400, 441, 484, 841, 900, 961, 1089, 1444, 1600, 1681, 1849, 4096, 4489, 4900, 6084, 6400, 6889, 8100, 8464, 8649, 9409, 9604, 9801, 10000, 10404, 10609, 10816, 11449, 11664, 11881, 14161, 14400, 14641, 14884
Offset: 1

Views

Author

Amarnath Murthy, Aug 21 2002

Keywords

Crossrefs

Intersection of A000290 and A084984.

Programs

  • Mathematica
    t1 = Prime[Range[4]]; Select[Range[0, 124]^2, Intersection[IntegerDigits[#], t1] == {} &] (* Jayanta Basu, Jul 31 2013 *)

Extensions

More terms from Jason Earls, Jul 03 2003
Offset changed by Andrew Howroyd, Sep 19 2024

A111484 Triangular numbers all of whose digits are nonprimes.

Original entry on oeis.org

0, 1, 6, 10, 66, 91, 190, 406, 496, 666, 861, 946, 990, 1081, 1891, 4186, 6441, 8001, 8646, 8911, 9180, 10011, 10440, 14196, 16110, 19110, 19900, 40186, 41041, 41616, 49141, 64980, 66066, 69006, 80601, 81406, 81810, 84666, 88410, 90100, 91806
Offset: 1

Views

Author

Jonathan Vos Post, Nov 15 2005

Keywords

Crossrefs

Programs

  • Perl
    my $n = 0, $t = 0, $i = 0;
    for (; $n < 6293912; $n++, $t += $n) {
     if ($t =~ m/^[014689]+$/) {
      $i++;
      print("$i $t\n");
     }
    } # Charles R Greathouse IV, Dec 17 2010
Previous Showing 31-32 of 32 results.