login

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

A086667
Triangular array, read by rows: T(n,k) = greatest decimal number of length k contained as a string in the first n positions of the decimal expansion of Pi, 1 <= k <= n.
0
3, 3, 31, 4, 31, 314, 4, 41, 314, 3141, 5, 41, 415, 3141, 31415, 9, 59, 415, 4159, 31415, 314159, 9, 92, 592, 4159, 41592, 314159, 3141592, 9, 92, 926, 5926, 41592, 415926, 3141592, 31415926, 9, 92, 926, 9265, 59265, 415926, 4159265, 31415926
OFFSET
1,1
COMMENTS
Conjecture: T(n,k) -> 10^k - 1.
LINKS
Dave Andersen, The Pi-Search Page.
Eric Weisstein's World of Mathematics, Pi.
EXAMPLE
Triangle begins:
3,
3, 31,
4, 31, 314,
4, 41, 314, 3141,
5, 41, 415, 3141, 31415,
...
CROSSREFS
Cf. A000796.
Sequence in context: A367890 A373740 A344934 * A067098 A188897 A088060
KEYWORD
nonn,base,tabl
AUTHOR
Reinhard Zumkeller, Jul 27 2003
STATUS
approved