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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A111039 To generate a(n), start with the positive integers and for every n remove every (a(n)+1)th number from the remaining sequence. (In other words, skip a(n) numbers between removals.) In contrast, to generate lucky numbers b(n), start with the odd positive integers and for every n remove every b(n)th number from the remaining sequence. 0
1, 3, 5, 9, 11, 17, 19, 21, 25, 33, 35, 41, 43, 49, 51, 53, 57, 67, 69, 75, 83, 89, 97, 99, 101, 107, 113, 115, 117, 129, 131, 137, 139, 147, 149, 163, 169, 171, 177, 181, 193, 195, 197, 211, 213, 217, 227, 229, 233, 243, 245, 259, 261, 267, 277 (list; graph; refs; listen; history; internal format)
OFFSET

0,2

COMMENTS

A variation on lucky numbers.

EXAMPLE

a(4)=9, not 7 because 7 was removed during the 2nd iteration with the rest of the (a(2)+1)th numbers (15, 23, 31, 39, etc.) in the sequence remaining after the 0th and first iterations.

CROSSREFS

Cf. A000959.

Sequence in context: A024414 A072391 A036696 * A114512 A118113 A076193

Adjacent sequences:  A111036 A111037 A111038 * A111040 A111041 A111042

KEYWORD

easy,nonn

AUTHOR

Brent Lehman (mailbjl2(AT)yahoo.com), Oct 05 2005

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 17 11:46 EST 2012. Contains 206011 sequences.