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!)
A077211 a(1) = 1; a(n+1) is the smallest square greater than n*a(n). 2

%I #6 Nov 22 2014 10:43:14

%S 1,4,9,36,169,900,5476,38416,308025,2775556,27762361,305410576,

%T 3664970521,47644848729,667028291524,10005429354496,160086894977025,

%U 2721477270128400,48986590869089316,930745227141407161

%N a(1) = 1; a(n+1) is the smallest square greater than n*a(n).

%H Harvey P. Dale, <a href="/A077211/b077211.txt">Table of n, a(n) for n = 1..450</a>

%F a(n+1)=(floor(sqrt(n*a(n)))+1)^2 - _Sam Alexander_, Mar 02 2005

%t nxt[{n_,a_}]:={n+1,(Floor[Sqrt[a*n]]+1)^2}; Transpose[NestList[nxt,{1,1},20]][[2]] (* _Harvey P. Dale_, Nov 22 2014 *)

%Y Cf. A077212.

%K nonn

%O 1,2

%A _Amarnath Murthy_, Nov 02 2002

%E More terms from _Sam Alexander_, Mar 02 2005

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 April 19 19:02 EDT 2024. Contains 371798 sequences. (Running on oeis4.)