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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A108202 a(2n) = the natural counting digits (0, 1, 2, ... 8, 9, 1, 0, 1, 1, 1, 2, 1, 3, ...); a(2n+1) = a(n). 5
0, 0, 1, 0, 2, 1, 3, 0, 4, 2, 5, 1, 6, 3, 7, 0, 8, 4, 9, 2, 1, 5, 0, 1, 1, 6, 1, 3, 1, 7, 2, 0, 1, 8, 3, 4, 1, 9, 4, 2, 1, 1, 5, 5, 1, 0, 6, 1, 1, 1, 7, 6, 1, 1, 8, 3, 1, 1, 9, 7, 2, 2, 0, 0, 2, 1, 1, 8, 2, 3, 2, 4, 2, 1, 3, 9, 2, 4, 4, 2, 2, 1, 5, 1, 2, 5, 6, 5, 2, 1, 7, 0, 2, 6, 8, 1, 2, 1, 9, 1, 3, 7, 0, 6, 3 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,5

COMMENTS

Fractal sequence (Kimberling-type) based upon the counting digits.

LINKS

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

CROSSREFS

Cf. A025480, A003602.

Sequence in context: A160588 A081171 A062778 * A025480 A088002 A030109

Adjacent sequences:  A108199 A108200 A108201 * A108203 A108204 A108205

KEYWORD

base,easy,nonn

AUTHOR

Juliette Bruyndonckx and Alexandre Wajnberg, Jun 15 2005

EXTENSIONS

More terms from Joshua Zucker, May 18 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 | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy .

Last modified June 24 07:19 EDT 2017. Contains 288697 sequences.