The OEIS is supported by the many generous donors to the OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A088673 n mod A002024(n), where A002024 is "n appears n times": 1, 2, 2, 3, 3, 3, ... 0
 0, 0, 1, 1, 2, 0, 3, 0, 1, 2, 1, 2, 3, 4, 0, 4, 5, 0, 1, 2, 3, 1, 2, 3, 4, 5, 6, 0, 5, 6, 7, 0, 1, 2, 3, 4, 1, 2, 3, 4, 5, 6, 7, 8, 0, 6, 7, 8, 9, 0, 1, 2, 3, 4, 5, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 0, 7, 8, 9, 10, 11, 0, 1, 2, 3, 4, 5, 6, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 0, 8, 9, 10, 11, 12, 13, 0, 1, 2 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,5 LINKS EXAMPLE a(7) = 3: A002024(7) = 4 and 7 mod 4 = 3. MATHEMATICA Table[Mod[n, Floor[1/2+Sqrt[2n]]], {n, 100}] (* Harvey P. Dale, Feb 09 2013 *) CROSSREFS Cf. A002024. Sequence in context: A160271 A274912 A065134 * A339662 A336316 A236138 Adjacent sequences:  A088670 A088671 A088672 * A088674 A088675 A088676 KEYWORD nonn,easy AUTHOR Gary W. Adamson, Oct 04 2003 EXTENSIONS Corrected and extended by Ray Chandler, Oct 04 2003 STATUS approved

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.

Last modified May 28 18:24 EDT 2022. Contains 354122 sequences. (Running on oeis4.)