login
A110766
Fractalization of Pi.
4
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, 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, 8, 3, 8, 5, 4, 8, 1, 3, 9, 4, 7, 4, 1, 6, 6, 5, 9
OFFSET
1,1
COMMENTS
Self-descriptive sequence: even terms are the sequence itself, odd terms are the digits of the decimal expansion of Pi.
LINKS
Clark Kimberling, Fractal sequences.
FORMULA
a(2n) = a(n); a(2n-1) = digits of Pi.
PROG
(Haskell)
import Data.List (transpose)
a110766 n = a110766_list !! (n-1)
a110766_list = concat $ transpose [a000796_list, a110766_list]
-- Reinhard Zumkeller, Aug 29 2014
CROSSREFS
Cf. A000796 (Pi), A003602.
Sequence in context: A293866 A161200 A214747 * A166314 A109630 A201439
KEYWORD
easy,nonn,base
AUTHOR
Alexandre Wajnberg, Sep 15 2005
EXTENSIONS
a(85) corrected and formula fixed by Reinhard Zumkeller, Aug 29 2014
STATUS
approved