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

A091803 (Smallest n-digit multiple of the n-th prime) - 10^(n-1).

Original entry on oeis.org

1, 2, 0, 1, 10, 9, 8, 4, 21, 11, 26, 11, 23, 5, 43, 6, 11, 2, 53, 52, 1, 17, 2, 10, 22, 91, 89, 63, 106, 76, 95, 25, 136, 6, 96, 149, 111, 67, 51, 56, 35, 105, 106, 34, 127, 11, 10, 202, 5, 182, 28, 139, 187, 4, 135, 23, 170, 171, 40, 124, 39, 123, 188, 251, 171, 123, 207, 87
Offset: 1

Views

Author

Amarnath Murthy, Feb 21 2004

Keywords

Crossrefs

a(n) = A079821(n) - 10^(n-1).

Extensions

Corrected and extended by Ray Chandler, Feb 22 2004

A079822 Smallest n-digit multiple of the n-th composite number.

Original entry on oeis.org

4, 12, 104, 1008, 10000, 100008, 1000006, 10000005, 100000000, 1000000008, 10000000000, 100000000002, 1000000000010, 10000000000008, 100000000000000, 1000000000000014, 10000000000000017
Offset: 1

Views

Author

Amarnath Murthy, Feb 11 2003

Keywords

Crossrefs

Cf. A079821.

Programs

  • Mathematica
    nm[{a_,b_}]:=Module[{c=Mod[10^(a-1),b]},If[c==0,10^(a-1),10^(a-1)+b-c]]; nm/@ With[{nn=25},Thread[{Range[nn],Rest[Complement[Range[ nn+ PrimePi[nn]+ 1], Prime[Range[PrimePi[nn+1]]]]]}]] (* Harvey P. Dale, Feb 14 2012 *)

Extensions

More terms from Erich Friedman, Aug 08 2005
Showing 1-2 of 2 results.