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.

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

This page as a plain text file.
%I A076997 #14 Dec 02 2024 18:53:05
%S A076997 1,1,1,1,4,16,81,529,4225,38025,379456,4173849,50083929,651066256,
%T A076997 9114902784,136723197121,2187571153936,37188701848516,669396605290000,
%U A076997 12718535343402256,254370705884725824,5341784820136403409
%N A076997 a(1) = 1, a(n+1) is the largest square <= n*a(n).
%H A076997 Amiram Eldar, <a href="/A076997/b076997.txt">Table of n, a(n) for n = 1..451</a> (terms below 10^1000)
%p A076997 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 A076997 a[1] = 1; a[n_] := a[n] = Floor[Sqrt[(n-1)*a[n-1]]]^2; Array[a, 22] (* _Amiram Eldar_, Sep 24 2023 *)
%t A076997 nxt[{n_,a_}]:={n+1,Floor[Sqrt[a*n]]^2}; NestList[nxt,{1,1},30][[;;,2]] (* _Harvey P. Dale_, Dec 02 2024 *)
%Y A076997 Cf. A076998.
%K A076997 nonn
%O A076997 1,5
%A A076997 _Amarnath Murthy_, Oct 26 2002
%E A076997 Corrected and extended by _Sascha Kurz_, Jan 26 2003