id:A057431 - OEIS Search Results

Search: id:A057431

Displaying 1-1 of 1 results found.

page 1

Obtained by reading first numerator then denominator of fractions in full Stern-Brocot tree (A007305/A047679).

+0
2

0, 1, 1, 0, 1, 1, 1, 2, 2, 1, 1, 3, 2, 3, 3, 2, 3, 1, 1, 4, 2, 5, 3, 5, 3, 4, 4, 3, 5, 3, 5, 2, 4, 1, 1, 5, 2, 7, 3, 8, 3, 7, 4, 7, 5, 8, 5, 7, 4, 5, 5, 4, 7, 5, 8, 5, 7, 4, 7, 3, 8, 3, 7, 2, 5, 1, 1, 6, 2, 9, 3, 11, 3, 10, 4, 11, 5, 13, 5, 12, 4, 9, 5, 9, 7, 12, 8, 13, 7, 11, 7, 10, 8, 11, 7, 9, 5, 6, 6, 5 (list; graph; listen)

	OFFSET	`0,8`
	COMMENT	`When presented in this way, every row (e.g. row 3, 1 3 2 3 3 2 3 1) is a palindrome. - Joshua Zucker (joshua.zucker(AT)stanfordalumni.org), May 11 2006`
	LINKS	`N. J. A. Sloane, Stern-Brocot or Farey Tree` `Index entries for sequences related to Stern's sequences`
	CROSSREFS	`Cf. A007305, A047679, A007306, A002487, A057432.` `Sequence in context: A125778 A047110 A093869 this_sequence A057060 A152805 A064894` `Adjacent sequences: A057428 A057429 A057430 this_sequence A057432 A057433 A057434`
	KEYWORD	`nonn,easy`
	AUTHOR	`N. J. A. Sloane (njas(AT)research.att.com), Sep 08 2000`
	EXTENSIONS	`More terms from Joshua Zucker (joshua.zucker(AT)stanfordalumni.org), May 11 2006`

page 1

Search completed in 0.002 seconds

Last modified December 6 13:45 EST 2009. Contains 170429 sequences.

AT&T Labs Research