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.

A082796 Smallest multiple of n beginning with 6.

Original entry on oeis.org

6, 6, 6, 60, 60, 6, 63, 64, 63, 60, 66, 60, 65, 602, 60, 64, 68, 612, 608, 60, 63, 66, 69, 600, 600, 624, 621, 616, 609, 60, 62, 64, 66, 68, 630, 612, 629, 608, 624, 600, 615, 630, 602, 616, 630, 644, 611, 624, 637, 600, 612, 624, 636, 648, 605, 616, 627, 638
Offset: 1

Views

Author

Amarnath Murthy, Apr 20 2003

Keywords

Comments

a(n) is in {n, 2n, 3n, 4n, 5n, 6n, 7n, 8n, 9n, 11n, 12n, 13n, 14n, 15n, 16n, 17n, 18n, 21n, 22n, 23n, 24n, 25n, 26n, 31n, 32n, 33n, 34n, 35n, 41n, 42n, 43n, 51n, 52n}. - Charles R Greathouse IV, Mar 06 2011

Crossrefs

Programs

  • Haskell
    a082796 n = until ((== 6) . a000030) (+ n) n
    -- Reinhard Zumkeller, Mar 27 2012
    
  • Mathematica
    f[n_] := Block[{m = n}, While[ First@ IntegerDigits@ m != 6, m += n]; m]; Array[f, 55] (* Robert G. Wilson v *)
  • PARI
    a(n)=forstep(k=n, 52*n, n, if(Vec(Str(k))[1]=="6", return(k))) \\ Charles R Greathouse IV, Mar 06 2011
    
  • Python
    def a(n):
        m = n
        while str(m)[0] != '6': m += n
        return m
    print([a(n) for n in range(1, 59)]) # Michael S. Branicky, Jun 06 2021

Extensions

More terms from Sean A. Irvine, Mar 06 2011