id:A081664 - OEIS Search Results

Search: id:A081664

Displaying 1-1 of 1 results found.

page 1

For the smallest q for which there exists a fraction p/q containing n in its decimal expansion, this sequence gives the smallest p.

+0
2

1, 1, 1, 2, 1, 2, 3, 4, 9, 1, 1, 1, 2, 1, 2, 1, 1, 2, 1, 1, 3, 2, 1, 6, 1, 4, 3, 1, 1, 3, 5, 8, 1, 1, 5, 4, 3, 2, 1, 2, 5, 1, 7, 4, 5, 2, 1, 12, 1, 1, 5, 1, 2, 5, 5, 9, 1, 7, 13, 3, 2, 5, 4, 9, 13, 2, 19, 11, 1, 7, 1, 3, 11, 2, 3, 1, 7, 11, 19, 4, 2, 1, 5, 2, 1, 13, 7, 8, 1, 9, 11, 1, 14, 1, 19, 24, 33, 49 (list; graph; listen)

	OFFSET	`1,4`
	COMMENT	`Inspired by problem 14 on the 2003 American Invitational Mathematics Examination, which asked for a(251). There are some slightly different versions of this sequence. For example, you could consider 1/2 = .5 or 1/2 = .50000...; I chose the latter interpretation here.`
	LINKS	`American Mathematics Competitions, Problem 14`
	EXAMPLE	`a(6) = 2 because 2/3 = .6...; a(24) = 6 because 6/25 = .24`
	CROSSREFS	`A081665 gives the denominators.` `Sequence in context: A022875 A076480 A002730 this_sequence A117673 A107946 A054502` `Adjacent sequences: A081661 A081662 A081663 this_sequence A081665 A081666 A081667`
	KEYWORD	`base,frac,nonn`
	AUTHOR	`Joshua Zucker (joshua.zucker(AT)stanfordalumni.org), Mar 26 2003`

page 1

Search completed in 0.002 seconds

Last modified August 19 23:53 EDT 2008. Contains 142930 sequences.

AT&T Labs Research