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 A309837 #33 Sep 24 2019 09:40:08 %S A309837 0,4,6,8,10,12,16,18,24,30,36,48,60,72,84,96,108,120,144,168,180,240, %T A309837 300,336,360,420,480,504,540,600,660,720,840,1080,1260,1440,1680,2160, %U A309837 2520,3360,3780,3960,4200,4320,4620,4680,5040,6720,7560,9240,10080,12600,13860 %N A309837 Where records occur in A327642. %C A309837 Numbers where the number of partitions of n into divisors of n that are at most sqrt(n) increases to a record. %C A309837 Is k unbounded where k | a(n) for all n > m for some m. For example, does 2 | a(n) for all n > 1? Does 60 | a(n) for all n > 27? %e A309837 There are 1072 partitions of 36 into divisors <= sqrt(36) of 36, i.e. there are 1072 partitions of 36 into parts 1, 2, 3 and 6. For all k < 36, this number of partitions is < 1073 so 36 is in the sequence. %Y A309837 Cf. A327642. %K A309837 nonn %O A309837 1,2 %A A309837 _David A. Corneth_, Sep 22 2019