%I #12 Feb 26 2021 17:03:48

%S 3,3,1,3,4,1,1,3,5,4,9,1,2,1,6,3,5,5,3,4,5,9,8,1,9,2,7,1,9,6,3,3,2,5,

%T 3,5,8,3,4,4,6,5,2,9,6,8,4,1,3,9,3,2,8,7,3,1,2,9,7,6,9,3,5,3,0,2,2,5,

%U 8,3,8,5,4,8,1,3,9,4,7,4,1,6,6,5,9

%N Fractalization of Pi.

%C Self-descriptive sequence: even terms are the sequence itself, odd terms are the digits of the decimal expansion of Pi.

%H Reinhard Zumkeller, <a href="/A110766/b110766.txt">Table of n, a(n) for n = 1..10000</a>

%H Clark Kimberling, <a href="http://faculty.evansville.edu/ck6/integer/fractals.html">Fractal sequences</a>.

%F a(2n) = a(n); a(2n-1) = digits of Pi.

%o (Haskell)

%o import Data.List (transpose)

%o a110766 n = a110766_list !! (n-1)

%o a110766_list = concat $ transpose [a000796_list, a110766_list]

%o -- _Reinhard Zumkeller_, Aug 29 2014

%Y Cf. A000796 (Pi), A003602.

%K easy,nonn,base

%O 1,1

%A _Alexandre Wajnberg_, Sep 15 2005

%E a(85) corrected and formula fixed by _Reinhard Zumkeller_, Aug 29 2014