The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 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 (list; graph; refs; listen; history; text; internal format)
 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 Chai Wah Wu, Table of n, a(n) for n = 1..500 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 Cf. A000005, A027423, A275476. Sequence in context: A002618 A135616 A069553 * A143481 A093968 A064713 Adjacent sequences:  A275823 A275824 A275825 * A275827 A275828 A275829 KEYWORD nonn AUTHOR Altug Alkan, Aug 10 2016 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified August 14 08:08 EDT 2020. Contains 336480 sequences. (Running on oeis4.)