Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A121347
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A121347 Largest number whose factorial is less than (n!)^2. +0
3
2, 4, 5, 7, 9, 10, 12, 14, 15, 17, 19, 20, 22, 24, 26, 27, 29, 31, 32, 34, 36, 38, 39, 41, 43, 44, 46, 48, 50, 51, 53, 55, 57, 58, 60, 62, 64, 65, 67, 69, 71, 72, 74, 76, 78, 79, 81, 83, 85, 87, 88, 90, 92, 94, 95, 97, 99, 101, 102, 104, 106, 108, 110, 111, 113, 115, 117, 118 (list; graph; listen)
OFFSET

2,1

EXAMPLE

a(3)=4 because 4!=24 is the largest factorial not exceeding (3!)^2=36.

PROGRAM

(PARI) A121347(n)= { local(lognf=2*sum(s=1, n, log(s)), k=1) ; while(1, if( sum(s=1, k, log(s))< lognf, k++, return(k-1) ; ) ; ) ; } { for(n=2, 80, print1(A121347(n), ", ") ; ) ; } - R. J. Mathar (mathar(AT)strw.leidenuniv.nl), May 12 2007

CROSSREFS

Cf. A121348 [difference between (n!)^2 and the next smaller factorial].

Sequence in context: A004956 A026351 A047212 this_sequence A106829 A083120 A001614

Adjacent sequences: A121344 A121345 A121346 this_sequence A121348 A121349 A121350

KEYWORD

nonn

AUTHOR

Hugo Pfoertner (hugo(AT)pfoertner.org), Aug 15 2006

EXTENSIONS

a(2) corrected by Jon Schoenfield, Aug 27 2006

More terms from R. J. Mathar (mathar(AT)strw.leidenuniv.nl), May 12 2007

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified November 25 14:49 EST 2009. Contains 167514 sequences.


AT&T Labs Research