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.

A109893 a(n) = least integer of the form (n!-1)(n!-2)...(n!-k)/n!.

Original entry on oeis.org

10, 8855, 182637273, 187913191983517, 16299312030218924938187, 173083581780047419995380839040497, 300642522445723721070400405660702004585922575, 109109034687569422667248530075550555291614316919209445960161, 10269669381215922304236773275682334781908421087118493054965910074350106387039
Offset: 3

Views

Author

Amarnath Murthy, Jul 13 2005

Keywords

Comments

k <= n. Subsidiary sequence: n such that k < n.

Examples

			a(3) = 5*4*3/6 =10. a(4) = 23*22*21*20/4! = 8855.
		

Crossrefs

Cf. A109892.

Programs

  • Maple
    A109893 := proc(n) local k ; for k from 1 to n do if mul( n!-i,i=1..k) mod ( n! ) = 0 then RETURN( mul(n!-i,i=1..k)/n!) ; fi ; od: end: seq(A109893(n),n=3..12) ; # R. J. Mathar, Feb 13 2008

Extensions

Corrected and extended by R. J. Mathar, Feb 13 2008