cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A108202 a(2n) = A007376(n); a(2n+1) = a(n).

Original entry on oeis.org

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
Offset: 0

Views

Author

Juliette Bruyndonckx and Alexandre Wajnberg, Jun 15 2005

Keywords

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.

Crossrefs

First differs from A025480 at a(20).
Even bisection: A007376.
Cf. A003602.

Formula

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

Extensions

More terms from Joshua Zucker, May 18 2006
Name made more explicit by Peter Munn, Nov 20 2020