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.

A011777 a(n) = least k>1 such that k^n divides k!.

This page as a plain text file.
%I A011777 #10 Mar 30 2012 17:30:16
%S A011777 2,6,15,18,12,32,24,36,40,45,48,100,84,60,154,165,72,96,80,126,90,135,
%T A011777 286,200,312,264,168,120,297,189,160,330,544,210,144,224,300,385,396,
%U A011777 324,252,680,350,180,280,748,572,486,400,405,315,528,320,336,450,512,288,240,715
%N A011777 a(n) = least k>1 such that k^n divides k!.
%C A011777 For n >= 2, least k such that A011776(k)=n.
%D A011777 Ivan Niven, Herbert S. Zuckerman and Hugh L. Montgomery, An Introduction to the Theory Of Numbers, Fifth Edition, John Wiley and Sons, Inc., NY 1991.
%D A011777 J. Roberts, Lure of the Integers, Math. Assoc. America, 1992, p. 251.
%H A011777 T. D. Noe, <a href="/A011777/b011777.txt">Table of n, a(n) for n=1..345</a>
%H A011777 <a href="/index/Fa#factorial">Index entries for sequences related to factorial numbers</a>
%Y A011777 See A133481 for a better version. Cf. A011776, A011778.
%K A011777 nonn,easy
%O A011777 1,1
%A A011777 _Robert G. Wilson v_