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!)
A159263 a(0)=181; for n > 0, a(n) = a(n-1) + floor(sqrt a(n-1)). 1

%I #11 Jan 07 2020 18:11:55

%S 181,194,207,221,235,250,265,281,297,314,331,349,367,386,405,425,445,

%T 466,487,509,531,554,577,601,625,650,675,700,726,752,779,806,834,862,

%U 891,920,950,980,1011,1042,1074,1106,1139,1172,1206,1240,1275,1310,1346

%N a(0)=181; for n > 0, a(n) = a(n-1) + floor(sqrt a(n-1)).

%C Row 12 in square array A159016. This sequence contains infinitely many squares.

%H G. C. Greubel, <a href="/A159263/b159263.txt">Table of n, a(n) for n = 0..5000</a>

%t RecurrenceTable[{a[n]==a[n-1] + Floor[Sqrt[a[n-1]]], a[0] == 181}, a, {n, 0, 50}] (* _G. C. Greubel_, Jun 28 2018 *)

%Y Cf. A159016.

%K nonn

%O 0,1

%A _Philippe Deléham_, Apr 07 2009

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 25 11:16 EDT 2024. Contains 371967 sequences. (Running on oeis4.)