login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A108202 a(2n) = A007376(n); a(2n+1) = a(n). 5

%I #23 Nov 27 2020 06:40:53

%S 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,

%T 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,

%U 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

%N a(2n) = A007376(n); a(2n+1) = a(n).

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

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

%C Similar to but different from A025480 - _N. J. A. Sloane_, Nov 26 2020.

%F a(n) = A007376(A025480(n)). - _Kevin Ryde_, Nov 21 2020

%Y First differs from A025480 at a(20).

%Y Even bisection: A007376.

%Y Cf. A003602.

%K base,easy,nonn

%O 0,5

%A Juliette Bruyndonckx and _Alexandre Wajnberg_, Jun 15 2005

%E More terms from _Joshua Zucker_, May 18 2006

%E Name made more explicit by _Peter Munn_, Nov 20 2020

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 18 22:18 EDT 2024. Contains 371782 sequences. (Running on oeis4.)