A110766 Fractalization of Pi.

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

Author

Alexandre Wajnberg, Sep 15 2005

Keywords

• easy
• nonn
• base

Comments

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

Links

• Reinhard Zumkeller, Table of n, a(n) for n = 1..10000
• Clark Kimberling, Fractal sequences.

Crossrefs

Cf. A000796 (Pi), A003602.

Cf. A110779 (of e), A110812 (of sqrt 2), A382130 (of phi).

Programs

Haskell

import Data.List (transpose)
a110766 n = a110766_list !! (n-1)
a110766_list = concat $ transpose [a000796_list, a110766_list]
-- Reinhard Zumkeller, Aug 29 2014

Formula

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

Extensions

a(85) corrected and formula fixed by Reinhard Zumkeller, Aug 29 2014