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.

Showing 1-2 of 2 results.

A096126 a(n) is the least integer of the form (n^2)!/(n!)^k.

Original entry on oeis.org

1, 3, 280, 2627625, 5194672859376, 5150805819130303332, 1461034854396267778567973305958400, 450538787986875167583433232345723106006796340625, 146413934927214422927834111686633731590253260933067148964500000000
Offset: 1

Views

Author

Amarnath Murthy, Jul 03 2004

Keywords

Comments

(n^2)!/(n!)^(n+1) is an integer for every n (see A057599). Hence k >= n+1. Conjecture: k=n+1 only when n is prime or a power of a prime.

Examples

			a(4) = 16!/(4!)^5 = 2627625 which is not further divisible by 24.
		

Crossrefs

Programs

  • PARI
    a(n)={if(n==1, 1, (n^2)!/(n!^valuation((n^2)!,n!)))} \\ Andrew Howroyd, Nov 09 2019

Extensions

Edited by Don Reble, Jul 04 2004
a(9) from Andrew Howroyd, Nov 09 2019

A244443 Smallest integer m > 1 such that m!^(m + n) divides (m^2)!.

Original entry on oeis.org

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
Offset: 1

Views

Author

Farideh Firoozbakht, Aug 24 2014

Keywords

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

Examples

			a(4) = 77 because 77!^(77 + 4) divides (77^2)! and 77 is the smallest integer m, m > 1, with this property.
		

Crossrefs

Programs

  • 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

Extensions

a(9)-a(13) from Jens Kruse Andersen, Aug 31 2014
a(14)-a(27) from Hiroaki Yamanouchi, Sep 29 2014
Showing 1-2 of 2 results.