id:A073597 - OEIS Search Results

Search: id:A073597

Displaying 1-1 of 1 results found.

page 1

Write Pi=3.d(1)d(2)d(3)....... where d(m) is the m-th digit of the decimal expansion of Pi. Then a(n)=m is the smallest integer such that 1/(n+1)< 0.d(m)d(m+1)d(m+2).....< 1/n.

+0
1

3, 1, 5, 15, 36, 2, 109, 93, 48, 53, 76, 64, 286, 96, 70, 780, 49, 365, 442, 774, 374, 269, 908, 1172, 1911, 194, 356, 84, 723, 2566, 856, 3100, 1043, 31, 158, 556, 163, 3118, 1745, 290 (list; graph; listen)

	OFFSET	`1,1`
	FORMULA	`a(n)=m is solution to n = floor(1/frac(10^m*Pi))`
	CROSSREFS	`Sequence in context: A059616 A125053 A124740 this_sequence A104053 A039512 A140825` `Adjacent sequences: A073594 A073595 A073596 this_sequence A073598 A073599 A073600`
	KEYWORD	`base,nonn`
	AUTHOR	`Benoit Cloitre (benoit7848c(AT)orange.fr), Aug 29 2002`

page 1

Search completed in 0.004 seconds

Last modified November 25 20:09 EST 2009. Contains 167514 sequences.

AT&T Labs Research