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.

A359957 a(n) is the smallest number with exactly n divisors that are greater than or equal to 6.

This page as a plain text file.
%I A359957 #9 Jan 04 2024 14:01:44
%S A359957 6,12,18,24,36,48,60,72,126,192,120,168,180,252,240,336,576,3072,360,
%T A359957 504,1296,900,960,1344,720,1008,840,1512,4158,27027,1260,2016,9702,
%U A359957 63063,1680,3024,2880,4032,15360,3600,7056,94864,2520,5544,6480,9072,61440,86016
%N A359957 a(n) is the smallest number with exactly n divisors that are greater than or equal to 6.
%H A359957 <a href="/index/Di#divisors">Index entries for sequences related to divisors of numbers</a>
%t A359957 Table[SelectFirst[Table[{n,Count[Divisors[n],_?(#>5&)]},{n,100000}],#[[2]]==k&],{k,50}] [[;;,1]] (* _Harvey P. Dale_, Jan 04 2024 *)
%o A359957 (PARI) a(n) = my(k=1); while (sumdiv(k, d, (d>=6)) != n, k++); k; \\ _Michel Marcus_, Jan 20 2023
%Y A359957 Cf. A005179, A338649, A359955, A359956.
%K A359957 nonn
%O A359957 1,1
%A A359957 _Ilya Gutkovskiy_, Jan 19 2023