This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A244443 Smallest integer m > 1 such that m!^(m + n) divides (m^2)!. 0
 2, 6, 15, 77, 185, 187, 475, 3820, 4043, 4090, 11231, 30589, 57023, 126815, 131055, 983032, 983033, 2617339, 4046839, 11534206, 11534207, 65011702, 66777087, 368279551, 469745405, 973061887, 1064828671 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 COMMENTS The constraint m > 1 is necessary because (1^2)! = 1. The motivation for this sequence came from comments on the sequence A246048 by M. F. Hasler. The integer (3820^2)!/(3820!)^3828 related to a(8) has 52166326 digits, so it isn't easy to find more terms. a(28) > 1.5 * 10^9. - Hiroaki Yamanouchi, Sep 29 2014 LINKS EXAMPLE a(4) = 77 because 77!^(77 + 4) divides (77^2)! and 77 is the smallest integer m, m > 1, with this property. PROG (PARI) for(n=1, 7, m=2; while((m^2)!%(m!^(m+n)), m++); print1(m", ")) \\ Jens Kruse Andersen, Aug 31 2014 (PARI) n=f=1; for(m=2, 5000, f*=m; s=m^2; forprime(p=2, m, e=0; b=p; while(b<=s, e+=s\b; b*=p); if(valuation(f, p)*(m+n)>e, next(2))); print1(m", "); n++) \\ Faster program. Jens Kruse Andersen, Aug 31 2014 CROSSREFS Cf. A096126, A096127, A246048. Sequence in context: A216811 A307180 A009455 * A319336 A007709 A190339 Adjacent sequences:  A244440 A244441 A244442 * A244444 A244445 A244446 KEYWORD nonn,more,hard AUTHOR Farideh Firoozbakht, Aug 24 2014 EXTENSIONS a(9)-a(13) from Jens Kruse Andersen, Aug 31 2014 a(14)-a(27) from Hiroaki Yamanouchi, Sep 29 2014 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 17 11:06 EDT 2019. Contains 326057 sequences. (Running on oeis4.)