A104807 - 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

A104807

Length of sections with distinct digits in the decimal expansion of Pi.

3, 5, 2, 4, 3, 5, 3, 2, 6, 2, 5, 4, 1, 6, 7, 2, 10, 5, 5, 4, 4, 5, 2, 4, 6, 2, 6, 5, 7, 1, 5, 2, 3, 4, 3, 7, 2, 2, 1, 7, 5, 7, 1, 3, 1, 4, 3, 4, 3, 3, 6, 3, 7, 4, 2, 5, 4, 4, 4, 7, 4, 3, 5, 4, 5, 5, 5, 4, 6, 2, 5, 6, 5, 5, 2, 2, 2, 4, 2, 4, 1, 6, 4, 2, 2, 7, 5, 7, 4, 1, 2, 2, 3, 5, 5, 7, 5, 3, 2, 1, 6, 5, 5, 3, 3

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

OFFSET

1,1

COMMENTS

Start with decimal expansion of Pi: 3,1,4,1,5,9,2,6,5,3,5,8,9,7,9,3,2,3,8,4,6,2,6,4,3... Split the sequence into maximal sections with distinct digits: s={3,1,4},{1,5,9,2,6},{5,3},{5,8,9,7},{9,3,2},{3,8,4,6,2},{6,4,3},... Then a(n) = length[s(n)]: 3,5,2,4,3,5,3,... Sections with maximal length = 10 A104808.

LINKS

Table of n, a(n) for n=1..105.

CROSSREFS

Cf. A104808, A000796.

Sequence in context: A113475 A182743 A222601 * A309492 A131793 A065186

Adjacent sequences: A104804 A104805 A104806 * A104808 A104809 A104810

KEYWORD

nonn,base

AUTHOR

Zak Seidov, Mar 26 2005

STATUS

approved