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-3 of 3 results.

A082791 Smallest k such that k*n begins with 2: a(n) = A082811(n)/n.

Original entry on oeis.org

2, 1, 7, 5, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 14, 13, 12, 12, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3
Offset: 1

Views

Author

Amarnath Murthy, Apr 19 2003

Keywords

Comments

a(n) is in {1, 2, 3, 4, 5, 6, 7, 11, 12, 13, 14}. [Charles R Greathouse IV, Mar 06 2011]

Links

Crossrefs

Cf. A082784, A054850, A082786, A082787, A082788, A082789, A082811.

Programs

Extensions

More terms from Zak Seidov, 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-3 of 3 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.