|
| |
|
|
A060984
|
|
a(1) = 1; a(n+1) = a(n) + (largest square <= a(n)).
|
|
5
| |
|
|
1, 2, 3, 4, 8, 12, 21, 37, 73, 137, 258, 514, 998, 1959, 3895, 7739, 15308, 30437, 60713, 121229, 242333, 484397, 967422, 1933711, 3865811, 7730967, 15459367, 30912128, 61814609, 123625653, 247235577, 494448306, 988888002, 1977738918, 3955408759
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 1,2
|
|
|
COMMENTS
| Arises in analyzing `put-or-take' games (see Winning Ways, 484-486, 501-503), the prototype being Epstein's Put-or-Take-a-Square game.
|
|
|
REFERENCES
| E. R. Berlekamp, J. H. Conway and R. K. Guy, Winning Ways, Academic Press, NY, 2 vols., 1982.
|
|
|
LINKS
| Harry J. Smith, Table of n, a(n) for n=1,...,500
|
|
|
FORMULA
| a(n+1) = a(n)+[sqrt(a(n))]^2 = a(n)+A061886(n) = a(n)+A048760(a(n)) = A061887(a(n)) - Henry Bottomley (se16(AT)btinternet.com), May 12 2001
|
|
|
MATHEMATICA
| a[1] = 1; a[n_] := a[n] = a[n - 1] + Floor[ Sqrt[ a[n - 1] ] ]^2; Table[ a[n], {n, 1, 40} ]
RecurrenceTable[{a[1]==1, a[n]==a[n-1]+Floor[Sqrt[a[n-1]]]^2}, a, {n, 40}] (* From Harvey P. Dale, Nov 19 2011 *)
|
|
|
PROG
| (PARI) { default(realprecision, 100); for (n=1, 500, if (n==1, a=1, a+=floor(sqrt(a))^2); write("b060984.txt", n, " ", a); ) } [From Harry J. Smith (hjsmithh(AT)sbcglobal.net), Jul 15 2009]
|
|
|
CROSSREFS
| Cf. A060985.
Sequence in context: A013914 A060200 A057608 * A098348 A131420 A095705
Adjacent sequences: A060981 A060982 A060983 * A060985 A060986 A060987
|
|
|
KEYWORD
| nonn,easy,nice
|
|
|
AUTHOR
| R. K. Guy (rkg(AT)cpsc.ucalgary.ca), May 11 2001
|
|
|
EXTENSIONS
| More terms from David W. Wilson (davidwwilson(AT)comcast.net), Henry Bottomley and Robert G. Wilson v, May 12, 2001
|
| |
|
|
