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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A102236 Slowest increasing sequence such that a(n) has a copy of itself in a(n+a(n)), with a(0)=0 and a(1)=1. 0
0, 1, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 100, 101, 110, 111, 112, 113, 130, 131, 140, 141, 150, 151, 160, 161, 170, 171, 180, 181, 190, 191, 192, 193, 194, 195, 196, 197, 198, 199, 200, 201, 202, 203, 204, 205, 206, 207, 208, 209, 210, 211, 212, 213, 214 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,3

LINKS

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

EXAMPLE

a(3) is 11; string "11" can be found in "110", which is a(3+a(3)) = a(14).

CROSSREFS

Sequence in context: A318699 A131835 A262390 * A250040 A321485 A047842

Adjacent sequences:  A102233 A102234 A102235 * A102237 A102238 A102239

KEYWORD

base,easy,nonn

AUTHOR

Eric Angelini, Feb 18 2005

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 18 12:18 EDT 2019. Contains 328160 sequences. (Running on oeis4.)