cp's OEIS Frontend

A091136 Smallest number m such that number of times m divides k! is almost k/n for large k, i.e., smallest m with A090624(m)=n.

%I A091136 #6 Jul 29 2017 04:11:46
%S A091136 1,2,3,8,5,32,7,128,25,512,11,2048,13,8192,2187,32768,17,131072,19,
%T A091136 524288,121,2097152,23,8388608,169,33554432,1594323,134217728,29,
%U A091136 536870912,31,2147483648,289,8589934592,129140163,34359738368,37
%N A091136 Smallest number m such that number of times m divides k! is almost k/n for large k, i.e., smallest m with A090624(m)=n.
%F A091136 a(n) = min_p{p prime and n divisible by p-1} p^(n/(p-1)).
%F A091136 a(p-1) = p.
%F A091136 a(2n+1) = 2^(2n+1).
%F A091136 Smallest divisor of A091137(n) which is not a divisor of A091137(n-1).
%e A091136 a(2)=3 noting that 100! is a multiple of 3^48 and 48 is almost 100/2.
%Y A091136 Cf. A090622, A090624, A091137.
%K A091136 nonn
%O A091136 0,2
%A A091136 _Henry Bottomley_, Dec 19 2003