login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A275476 Least k such that n divides d(k!) where d = A000005 (k > 0). 1
1, 2, 6, 3, 6, 6, 15, 4, 10, 6, 12, 7, 28, 15, 6, 5, 18, 10, 20, 7, 15, 12, 24, 8, 21, 28, 10, 15, 60, 6, 63, 8, 12, 18, 28, 11, 76, 20, 28, 9, 81, 15, 46, 12, 10, 24, 48, 8, 27, 21, 18, 28, 110, 10, 24, 15, 20, 60, 120, 7, 243, 63, 15, 15, 28, 12, 68, 18, 24, 28 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

LINKS

Table of n, a(n) for n=1..70.

EXAMPLE

a(3) = 6 because A000005(6!) = 30 is divisible by 3.

MATHEMATICA

Table[k = 1; While[! Divisible[DivisorSigma[0, k!], n], k++]; k, {n, 120}] (* Michael De Vlieger, Aug 07 2016 *)

PROG

(PARI) a(n) = {my(k = 1); while(numdiv(k!) % n != 0, k++); k; }

CROSSREFS

Cf. A000005, A027423.

Sequence in context: A177209 A274439 A280342 * A185380 A136695 A154129

Adjacent sequences:  A275473 A275474 A275475 * A275477 A275478 A275479

KEYWORD

nonn

AUTHOR

Altug Alkan, Jul 29 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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified May 23 19:07 EDT 2019. Contains 323528 sequences. (Running on oeis4.)