login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A076997 a(1) = 1, a(n+1) is the largest square <= n*a(n). 1

%I #12 Sep 24 2023 05:44:17

%S 1,1,1,1,4,16,81,529,4225,38025,379456,4173849,50083929,651066256,

%T 9114902784,136723197121,2187571153936,37188701848516,669396605290000,

%U 12718535343402256,254370705884725824,5341784820136403409

%N a(1) = 1, a(n+1) is the largest square <= n*a(n).

%H Amiram Eldar, <a href="/A076997/b076997.txt">Table of n, a(n) for n = 1..451</a> (terms below 10^1000)

%p a[1] := 1:for i from 2 to 65 do a[i] := (floor(evalf(sqrt((i-1)*a[i-1]+1/10^120),200)))^2:od:seq(a[i],i=1..65);

%t a[1] = 1; a[n_] := a[n] = Floor[Sqrt[(n-1)*a[n-1]]]^2; Array[a, 22] (* _Amiram Eldar_, Sep 24 2023 *)

%Y Cf. A076998.

%K nonn

%O 1,5

%A _Amarnath Murthy_, Oct 26 2002

%E Corrected and extended by _Sascha Kurz_, Jan 26 2003

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified September 15 02:04 EDT 2024. Contains 375929 sequences. (Running on oeis4.)