login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A053461 a(0) = 0; a(n) = a(n-1)-n^2 if positive and new, otherwise a(n) = a(n-1)+n^2. 3
0, 1, 5, 14, 30, 55, 19, 68, 4, 85, 185, 64, 208, 39, 235, 10, 266, 555, 231, 592, 192, 633, 149, 678, 102, 727, 51, 780, 1564, 723, 1623, 662, 1686, 597, 1753, 528, 1824, 455, 1899, 378, 1978, 297, 2061, 212, 2148, 123, 2239, 4448, 2144, 4545 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,3

COMMENTS

'Recamán transform' (see A005132) of the squares.

LINKS

Table of n, a(n) for n=0..49.

Nick Hobson, Python program for this sequence

Index entries for sequences related to Recamán's sequence

CROSSREFS

Sequence in context: A162208 A161698 A049791 * A136135 A231673 A211653

Adjacent sequences:  A053458 A053459 A053460 * A053462 A053463 A053464

KEYWORD

nonn

AUTHOR

N. J. A. Sloane, Feb 09 2002

STATUS

approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified March 21 22:19 EDT 2019. Contains 321382 sequences. (Running on oeis4.)