id:A006839 - OEIS Search Results

Search: id:A006839

Displaying 1-1 of 1 results found.

page 1

Minimum of largest partial quotient of continued fraction for k/n, (k,n) = 1.
(Formerly M0164)

+0
1

1, 1, 1, 2, 1, 4, 2, 1, 3, 2, 2, 2, 1, 3, 2, 3, 2, 2, 2, 4, 1, 3, 3, 2, 2, 2, 2, 4, 2, 2, 2, 3, 3, 1, 3, 3, 2, 4, 3, 2, 2, 4, 2, 2, 2, 2, 2, 3, 2, 2, 3, 3, 3, 5, 1, 2, 3, 2, 3, 3, 2, 3, 2, 2, 2, 3, 2, 2, 2, 2, 2, 3, 2, 2, 2, 2, 3, 3, 2, 2, 2, 3, 3, 3, 3, 3, 3, 3, 1, 3, 2, 3, 2, 3, 3, 4, 2, 2, 2, 2, 2, 3, 3, 2, 2, 2, 3, 2 (list; graph; listen)

	OFFSET	`1,4`
	REFERENCES	`H. Niederreiter, Dyadic functions with small partial quotients, Monat. f. Math., 101 (1986), 309-315.` `J. O. Shallit, personal communication.` `N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).`
	CROSSREFS	`Sequence in context: A031424 A013942 A088423 this_sequence A118235 A083653 A135152` `Adjacent sequences: A006836 A006837 A006838 this_sequence A006840 A006841 A006842`
	KEYWORD	`nonn`
	AUTHOR	`N. J. A. Sloane (njas(AT)research.att.com).`
	EXTENSIONS	`More terms from David W. Wilson (davidwwilson(AT)comcast.net)`

page 1

Search completed in 0.002 seconds

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

AT&T Labs Research