A110766 - OEIS

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

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”).

Other ways to Give

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

(list; graph; refs; listen; history; text; internal format)

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

Reinhard Zumkeller, Table of n, a(n) for n = 1..10000

Clark Kimberling, Fractal sequences.

FORMULA

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

PROG

(Haskell)