Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #8 Feb 26 2021 17:03:32
%S 2,2,7,2,1,7,8,2,2,1,8,7,1,8,8,2,2,2,8,1,4,8,5,7,9,1,0,8,4,8,5,2,2,2,
%T 3,2,5,8,3,1,6,4,0,8,2,5,8,7,7,9,4,1,7,0,1,8,3,4,5,8,2,5,6,2,6,2,2,2,
%U 4,3,9
%N Fractalization of e.
%C Self-descriptive sequence: even terms are the sequence itself, odd terms are the digits of the decimal expansion of e.
%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 e.
%Y Cf. A001113 (e), A003602.
%K easy,nonn,base
%O 1,1
%A _Alexandre Wajnberg_, Sep 15 2005