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

A133020 Divisors of 10000.

Original entry on oeis.org

1, 2, 4, 5, 8, 10, 16, 20, 25, 40, 50, 80, 100, 125, 200, 250, 400, 500, 625, 1000, 1250, 2000, 2500, 5000, 10000
Offset: 1

Views

Author

Omar E. Pol, Oct 27 2007

Keywords

Crossrefs

Programs

A133036 Divisors of 1816.

Original entry on oeis.org

1, 2, 4, 8, 227, 454, 908, 1816
Offset: 1

Views

Author

Omar E. Pol, Oct 28 2007

Keywords

Examples

			8*227 = 1816
		

Crossrefs

Cf. A018283.

Programs

A133040 Divisors of 1900.

Original entry on oeis.org

1, 2, 4, 5, 10, 19, 20, 25, 38, 50, 76, 95, 100, 190, 380, 475, 950, 1900
Offset: 1

Views

Author

Omar E. Pol, Oct 28 2007

Keywords

Examples

			38*50 = 1900.
		

Crossrefs

Programs

A178784 Let d be the vector of divisors of 100 sorted from largest to smallest, i.e., [100,50,25,20,10,5,4,2,1]. Then a(n) = 100/d(n) - 1.

Original entry on oeis.org

0, 1, 3, 4, 9, 19, 24, 49, 99
Offset: 1

Views

Author

Ross La Haye, Jun 13 2010

Keywords

Crossrefs

Cf. A018283.

Programs

  • Mathematica
    Map[(100/# - 1)&, Sort[Divisors[100], Greater]]
    Map[(#-1)&,Divisors[100]]  (* Ross La Haye, Jun 17 2010 *)
    100/Reverse[Divisors[100]]-1 (* Harvey P. Dale, Jan 14 2015 *)

Formula

a(n) = 100/A018283(10-n) - 1.
a(n) = A018283(n) - 1. - Ross La Haye, Jun 17 2010
Showing 1-4 of 4 results.