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.

Showing 1-7 of 7 results.

A082794 Smallest multiple of n beginning with 4.

Original entry on oeis.org

4, 4, 42, 4, 40, 42, 42, 40, 45, 40, 44, 48, 403, 42, 45, 48, 408, 414, 418, 40, 42, 44, 46, 48, 400, 416, 405, 420, 406, 420, 403, 416, 429, 408, 420, 432, 407, 418, 429, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 400, 408, 416, 424, 432, 440, 448, 456, 406, 413
Offset: 1

Views

Author

Amarnath Murthy, Apr 20 2003

Keywords

Comments

a(n) is in {n, 2n, 3n, 4n, 5n, 6n, 7n, 8n, 11n, 12n, 13n, 14n, 15n, 16n, 21n, 22n, 23n, 24n, 31n, 32n}. - Charles R Greathouse IV, Mar 06 2011

Links

Crossrefs

Cf. A082795, A082796, A082797, A082798.
Cf. A000030.

Programs

  • Haskell
    a082794 n = until ((== 4) . a000030) (+ n) n
-- Reinhard Zumkeller, Mar 27 2012
  • Maple
    a:= proc(n) option remember; local m; m:= 0;
      do m:=m+n; if (""||m)[1]="4" then break fi od; m
    end:
seq(a(n), n=1..60);  # Alois P. Heinz, Apr 04 2021
  • Mathematica
    f[n_] := Block[{m = n}, While[ First@ IntegerDigits@ m != 4, m += n]; m]; Array[f, 56] (* Robert G. Wilson v *)
  • PARI
    a(n)=forstep(k=n, 32*n, n, if(Vec(Str(k))[1]=="4", return(k))) \\ Charles R Greathouse IV, Mar 06 2011
  • Python
    def a(n):
  kn = n
  while str(kn)[0] != '4': kn += n
  return kn
print([a(n) for n in range(1, 57)]) # Michael S. Branicky, Apr 04 2021

Extensions

More terms from Sean A. Irvine, Mar 06 2011

A082795 Smallest multiple of n beginning with 5.

Original entry on oeis.org

5, 50, 51, 52, 5, 54, 56, 56, 54, 50, 55, 504, 52, 56, 510, 512, 51, 54, 57, 500, 504, 506, 506, 504, 50, 52, 54, 56, 58, 510, 527, 512, 528, 510, 525, 504, 518, 532, 507, 520, 533, 504, 516, 528, 540, 506, 517, 528, 539, 50, 51, 52, 53, 54
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, 21n, 22n, 23n, 24n, 25n, 31n, 32n, 33n, 34n, 41n, 42n}. [Charles R Greathouse IV, Mar 06 2011]

Links

Crossrefs

Cf. A082794, A082796, A082797, A082798.
Cf. A000030.

Programs

  • Haskell
    a082795 n = until ((== 5) . a000030) (+ n) n
-- Reinhard Zumkeller, Mar 27 2012
  • Mathematica
    f[n_] := Block[{m = n}, While[ First@ IntegerDigits@ m != 5, m += n]; m]; Array[f, 54] (* Robert G. Wilson v *)
  • PARI
    a(n)=forstep(k=n, 42*n, n, if(Vec(Str(k))[1]=="5", return(k))) \\ Charles R Greathouse IV, Mar 06 2011

Extensions

Corrected and extended by Sean A. Irvine, Mar 06 2011

A082797 Smallest multiple of n beginning with 7.

Original entry on oeis.org

7, 70, 72, 72, 70, 72, 7, 72, 72, 70, 77, 72, 78, 70, 75, 704, 714, 72, 76, 700, 714, 704, 713, 72, 75, 78, 702, 700, 725, 720, 713, 704, 726, 714, 70, 72, 74, 76, 78, 720, 738, 714, 731, 704, 720, 736, 705, 720, 735, 700, 714, 728, 742, 702, 715
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, 27n, 31n, 32n, 33n, 34n, 35n, 41n, 42n, 43n, 44n, 51n, 52n, 53n, 61n, 62n}. [Charles R Greathouse IV, Mar 06 2011]

Links

Crossrefs

Cf. A082794, A082795, A082796, A082798.
Cf. A000030.

Programs

  • Haskell
    a082797 n = until ((== 7) . a000030) (+ n) n
-- Reinhard Zumkeller, Mar 27 2012
  • Mathematica
    f[n_] := Block[{m = n}, While[ First@ IntegerDigits@ m != 7, m += n]; m]; Array[f, 55] (* Robert G. Wilson v *)
  • PARI
    a(n)=forstep(k=n, 62*n, n, if(Vec(Str(k))[1]=="7", return(k))) \\ Charles R Greathouse IV, Mar 06 2011

Extensions

Corrected and extended by Sean A. Irvine, Mar 06 2011

A082798 Smallest multiple of n beginning with 8.

Original entry on oeis.org

8, 8, 81, 8, 80, 84, 84, 8, 81, 80, 88, 84, 806, 84, 810, 80, 85, 810, 817, 80, 84, 88, 805, 816, 800, 806, 81, 84, 87, 810, 806, 800, 825, 816, 805, 828, 814, 836, 819, 80, 82, 84, 86, 88, 810, 828, 846, 816, 833, 800, 816, 832, 848, 810, 825, 840, 855, 812
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, 27n, 31n, 32n, 33n, 34n, 35n, 36n, 41n, 42n, 43n, 44n, 45n, 51n, 52n, 53n, 54n, 61n, 62n, 63n, 71n, 72n}. [Charles R Greathouse IV, Mar 06 2011]

Links

Crossrefs

Cf. A082794, A082795, A082796, A082797.
Cf. A000030.

Programs

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

Extensions

Corrected and extended by Sean A. Irvine, Mar 06 2011

A082792 Smallest multiple of n beginning with 3.

Original entry on oeis.org

3, 30, 3, 32, 30, 30, 35, 32, 36, 30, 33, 36, 39, 308, 30, 32, 34, 36, 38, 300, 315, 308, 322, 312, 300, 312, 324, 308, 319, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 320, 328, 336, 301, 308, 315, 322, 329, 336, 343, 300, 306, 312, 318, 324, 330, 336, 342, 348, 354
Offset: 1

Views

Author

Amarnath Murthy, Apr 20 2003

Keywords

Comments

a(n) is in {n, 2n, 3n, 4n, 5n, 6n, 7n, 8n, 11n, 12n, 13n, 14n, 15n, 21n, 22n, 23n}. - Charles R Greathouse IV, Mar 06 2011

Links

Crossrefs

Cf. A082793, A082794, A082795, A082796.
Cf. A000030.

Programs

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

Extensions

Corrected and extended by Sean A. Irvine, Mar 06 2011

A187285 Smallest multiple of n beginning with 1.

Original entry on oeis.org

1, 10, 12, 12, 10, 12, 14, 16, 18, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 100, 105, 110, 115, 120, 100, 104, 108, 112, 116, 120, 124, 128, 132, 102, 105, 108, 111, 114, 117, 120, 123, 126, 129, 132, 135, 138, 141, 144, 147, 100, 102, 104, 106, 108, 110
Offset: 1

Views

Author

Robert G. Wilson v, Mar 07 2011

Keywords

Comments

a(n) is in {n, 2n, 3n, 4n, 5n}. [Charles R Greathouse IV, Mar 07 2011]

Links

Crossrefs

Cf. A082811, A082792, A082794, A082795, A082796, A082797, A082798, A187090.
Cf. A000030.

Programs

  • Haskell
    a187285 n = until ((== 1) . a000030) (+ n) n
-- Reinhard Zumkeller, Mar 27 2012
  • Mathematica
    f[n_] := Block[{m = n}, While[ First@ IntegerDigits@ m != 1, m += n]; m]; Array[f, 55]
  • PARI
    a(n)=forstep(k=n, 5*n, n, if(Vec(Str(k))[1]=="1", return(k))) \\ Charles R Greathouse IV, Mar 07 2011

A187090 Smallest multiple of n beginning with 9.

Original entry on oeis.org

9, 90, 9, 92, 90, 90, 91, 96, 9, 90, 99, 96, 91, 98, 90, 96, 901, 90, 95, 900, 903, 902, 92, 96, 900, 910, 918, 924, 928, 90, 93, 96, 99, 918, 910, 900, 925, 912, 936, 920, 902, 924, 903, 924, 90, 92, 94, 96, 98, 900, 918, 936, 901, 918, 935
Offset: 1

Views

Author

Robert G. Wilson v, Mar 06 2011

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, 27n, 31n, 32n, 33n, 34n, 35n, 36n, 41n, 42n, 43n, 44n, 45n, 51n, 52n, 53n, 54n, 61n, 62n, 63n, 71n, 72n, 81n}. [Charles R Greathouse IV, Mar 06 2011]

Links

Crossrefs

Cf. A082811, A082792, A082794, A082795, A082796, A082797, A082798.
Cf. A000030.

Programs

  • Haskell
    a187090 n = until ((== 9) . a000030) (+ n) n
-- Reinhard Zumkeller, Mar 27 2012
  • Mathematica
    f[n_] := Block[{m = n}, While[ First@ IntegerDigits@ m != 9, m += n]; m]; Array[f, 55]
  • PARI
    a(n)=forstep(k=n, 81*n, n, if(Vec(Str(k))[1]=="9", return(k))) \\ Charles R Greathouse IV, Mar 06 2011
Showing 1-7 of 7 results.

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.