login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A108202 a(2n) = A007376(n); 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

A sequence, S, consisting of the natural counting digits (A007376) interleaved with S.

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

Similar to but different from A025480 - N. J. A. Sloane, Nov 26 2020.

LINKS

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

FORMULA

a(n) = A007376(A025480(n)). - Kevin Ryde, Nov 21 2020

CROSSREFS

First differs from A025480 at a(20).

Even bisection: A007376.

Cf. A003602.

Sequence in context: A081171 A334594 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

Name made more explicit by Peter Munn, Nov 20 2020

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 April 15 01:24 EDT 2021. Contains 342974 sequences. (Running on oeis4.)