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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A117634 a(0)=0. a(n) = a(n-1) + 1 + (number of positive integers which are <= n and are missing from {a(0),a(1),a(2),...a(n-1)}). 0
0, 2, 4, 7, 10, 14, 19, 24, 30, 37, 44, 52, 61, 71, 81, 92, 104, 117, 131, 145, 160, 176, 193, 211, 229, 248, 268, 289, 311, 334, 357, 381, 406, 432, 459, 487, 516, 545, 575, 606, 638, 671, 705, 740, 775, 811, 848, 886, 925, 965, 1006, 1048, 1090, 1133, 1177 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,2

LINKS

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

EXAMPLE

The sequence of positive integers not in this sequence begins 1, 3, 5, 6, 8,...

Because there are four such terms <= 7, then a(7) = a(6) + 1 + 4 = 24.

CROSSREFS

Sequence in context: A007980 A022339 A025711 * A022776 A025704 A025710

Adjacent sequences:  A117631 A117632 A117633 * A117635 A117636 A117637

KEYWORD

easy,nonn

AUTHOR

Leroy Quet, Apr 08 2006, definition corrected Apr 22 2006

EXTENSIONS

More terms from Sheedeh Dorri (spd145(AT)psu.edu), Apr 17 2006

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 October 22 22:34 EDT 2019. Contains 328335 sequences. (Running on oeis4.)