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.

A074181 Smallest power of n >= n!.

This page as a plain text file.
%I A074181 #19 Aug 10 2022 20:00:58
%S A074181 1,2,9,64,125,1296,16807,262144,531441,10000000,214358881,5159780352,
%T A074181 10604499373,289254654976,8649755859375,281474976710656,
%U A074181 582622237229761,20822964865671168,799006685782884121
%N A074181 Smallest power of n >= n!.
%H A074181 Danny Rorabaugh, <a href="/A074181/b074181.txt">Table of n, a(n) for n = 1..447</a>
%F A074181 From _Danny Rorabaugh_, Apr 14 2015: (Start)
%F A074181 a(n) = n^A074184(n).
%F A074181 a(n) = n^ceiling(log_n(n!)) for n>1.
%F A074181 a(n) = n*A074182(n) = n^A060151(n) = n^(1 + A039960(n)) = n! + A111683(n) for n>2.
%F A074181 (End)
%t A074181 Join[{1},Table[n^Ceiling[Log[n,n!]],{n,2,20}]] (* _Harvey P. Dale_, Aug 10 2022 *)
%o A074181 (Sage) [1]+[n^ceil(log(factorial(n))/log(n)) for n in range(2,20)] # _Danny Rorabaugh_, Apr 14 2015
%o A074181 (PARI) a(n)=if(n>2,n^(logint(n!,n)+1),n) \\ _Charles R Greathouse IV_, Oct 11 2015
%Y A074181 Cf. A074182.
%K A074181 nonn,easy
%O A074181 1,2
%A A074181 _Amarnath Murthy_, Aug 31 2002
%E A074181 More terms from _Jason Earls_, Sep 02 2002