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.

A240913 Numbers m such that GCD of digits of m is 1 and no digit of m is 1.

Original entry on oeis.org

23, 25, 27, 29, 32, 34, 35, 37, 38, 43, 45, 47, 49, 52, 53, 54, 56, 57, 58, 59, 65, 67, 72, 73, 74, 75, 76, 78, 79, 83, 85, 87, 89, 92, 94, 95, 97, 98, 203, 205, 207, 209, 223, 225, 227, 229, 230, 232, 233, 234, 235, 236, 237, 238, 239, 243, 245, 247, 249
Offset: 1

Views

Author

Reinhard Zumkeller, Apr 14 2014

Keywords

Comments

A052423(a(n)) = 1.

Crossrefs

Subsequence of A069715.

Programs

  • Haskell
    a240913 n = a240913_list !! (n-1)
    a240913_list = filter (not . elem '1' . show) a069715_list
    
  • Mathematica
    gcdQ[n_]:=Module[{idn=IntegerDigits[n]},!MemberQ[idn,1]&&GCD@@idn==1]; Select[ Range[300],gcdQ] (* Harvey P. Dale, Dec 17 2014 *)
  • PARI
    is(n)=my(d=Set(digits(n))); setsearch(d,1)==0 && gcd(d)==1 \\ Charles R Greathouse IV, Nov 01 2014