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.
%I A018283 #41 Aug 12 2024 18:22:59 %S A018283 1,2,4,5,10,20,25,50,100 %N A018283 Divisors of 100. %C A018283 From _Alonso del Arte_, Oct 10 2017: (Start) %C A018283 There are just three ways to partition 100 into its distinct divisors: 100 = 50 + 25 + 20 + 5 = 50 + 25 + 20 + 4 + 1 (see A033630). %C A018283 However, it's not possible to exchange a United States 1-dollar coin for smaller coins of distinct denominations in current circulation since there are no 4- or 20-cent coins (see A112024). %C A018283 Nor is it possible to exchange a 100-dollar bill for smaller bills of distinct denominations as there are no 4- or 25-dollar bills (see A124146). (End) %H A018283 <a href="/index/Di#divisors">Index entries for sequences related to divisors of numbers</a> %F A018283 a(n) = 2^((n-1) mod 3)*5^floor((n-1)/3). - _Aaron J Grech_, Aug 11 2024 %t A018283 Divisors[100] (* _Vladimir Joseph Stephan Orlovsky_, Feb 18 2012 *) %o A018283 (Sage) divisors(100); # _Zerinvary Lajos_, Jun 13 2009 %o A018283 (PARI) divisors(100) %Y A018283 This sequence is row n = 100 of A027750. %K A018283 nonn,fini,full,easy %O A018283 1,2 %A A018283 _N. J. A. Sloane_