id:A000319 - OEIS Search Results

Search: id:A000319

Displaying 1-1 of 1 results found.

page 1

a(n)=[ b(n) ], where b(n)=tan(b(n-1)), b(0)=1.

+0
3

1, 1, 74, -1, -2, -3, 0, 1, 30, -2, -2, 29, 1, 4, -6, 0, 1, 2, -1, -1, -1, -1, -2, -9, 0, 0, 1, 2, -2, -35, -1, -1, -1, -1, -1, -1, -1, -2, -3, 0, 0, 1, 5, -2, -2, 3, 1, 1, -4, -1, -1, -1, -1, -1, -1, -1, -1, -2, -3, 1, 2, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -2, -3, 0, 1, 2, -1, -2, -21, -7, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 (list; graph; listen)

	OFFSET	`0,3`
	COMMENT	`Using 3000-digit precision, interval arithmetic provides an efficient method of computing over 2000000 terms of this sequence. The iteration is stopped when an interval contains an integer. So far, no term equals 319. - T. D. Noe, Mar 07 2008`
	LINKS	`T. D. Noe, Table of n, a(n) for n=0..10000`
	CROSSREFS	`Sequence in context: A157724 A159438 A076848 this_sequence A033394 A114969 A104421` `Adjacent sequences: A000316 A000317 A000318 this_sequence A000320 A000321 A000322`
	KEYWORD	`sign`
	AUTHOR	`N. J. A. Sloane (njas(AT)research.att.com).`

page 1

Search completed in 0.002 seconds

Last modified November 22 20:51 EST 2009. Contains 167312 sequences.

AT&T Labs Research