login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A065731 Greatest perfect square that does not exceed n!. 3
1, 1, 1, 4, 16, 100, 676, 4900, 40000, 362404, 3625216, 39904489, 478996996, 6226945921, 87177877081, 1307672296225, 20922784184449, 355687416544329, 6402373660047556, 121645099966283776, 2432902006216007824 (list; graph; refs; listen; history; internal format)
OFFSET

0,4

LINKS

Harry J. Smith, Table of n, a(n) for n=0,...,100

FORMULA

a(n) = floor(sqrt(n!))^2

PROG

(PARI) { for (n=0, 100, a=sqrtint(n!)^2; write("b065731.txt", n, " ", a) ) } [From Harry J. Smith (hjsmithh(AT)sbcglobal.net), Oct 28 2009]

CROSSREFS

a(n)=A048760[A000142(n)]

Cf. A048760, A000142, A065730-A065741

Sequence in context: A145823 A121142 A087296 * A074187 A111883 A094637

Adjacent sequences:  A065728 A065729 A065730 * A065732 A065733 A065734

KEYWORD

easy,nonn

AUTHOR

Labos E. (labos(AT)ana.sote.hu), Nov 15 2001

EXTENSIONS

OFFSET changed from 1,4 to 0,4 by Harry J. Smith (hjsmithh(AT)sbcglobal.net), Oct 28 2009

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 15 21:56 EST 2012. Contains 205860 sequences.