login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A275826
Least k such that n! divides d(k!) (d = A000005, k > 0).
1
1, 2, 6, 8, 20, 20, 28, 36, 36, 56, 90, 90, 120, 126, 126, 126, 172, 172, 342, 342, 374, 380, 464, 464, 464, 464, 464, 464, 464, 464, 847, 847, 1056, 1105, 1105, 1105, 1105, 1105, 1330, 1330, 1728, 1728, 1728, 1728, 1728, 2410, 2856, 2856, 2856, 2856
OFFSET
1,2
COMMENTS
From Michael De Vlieger, Aug 10 2016: (Start)
Values in a(n): 1, 2, 6, 8, 20, 28, 36, 56, 90, 120, 126, 172, 342, 374, 380, 464, 847, 1056, 1105, 1330, 1728, 2410, 2856, ...
First position of values in a(n): 1, 2, 3, 4, 5, 7, 8, 10, 11, 13, 14, 17, 19, 21, 22, 23, 31, 33, 34, 39, 41, 46, 47, ...
(End)
LINKS
EXAMPLE
a(4) = 8 because A000005(8!) = 96 is divisible by 4! = 24.
MATHEMATICA
Table[k = 1; While[! Divisible[DivisorSigma[0, k!], n!], k++]; k, {n, 50}] (* Michael De Vlieger, Aug 10 2016 *)
PROG
(PARI) a(n) = {my(k=1); while(numdiv(k!) % n!, k++); k; }
CROSSREFS
KEYWORD
nonn
AUTHOR
Altug Alkan, Aug 10 2016
STATUS
approved