login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A110925 a(1) = 1; for n>1, a(n) is the smallest positive integer such that the continued fraction [a(1),a(2),a(3),...,a(n)] has numerator divisible by n. 0
1, 1, 1, 2, 4, 2, 7, 2, 7, 10, 5, 10, 4, 2, 7, 2, 9 (list; graph; refs; listen; history; internal format)
OFFSET

1,4

EXAMPLE

a(5) = 4 because 4 is the smallest positive integer m such that the continued fraction [1,1,1,2,m] has numerator divisible by 5.

1 + 1/(1 + 1/(1 + 1/(2 + 1/4))) = 35/22 and 35 is divisible by 5.

[1,1,1,2,4,2,7,2,7,10,5,10] equals 4878960/3065089 and 12 divides 4878960.

CROSSREFS

Sequence in context: A177847 A021416 A094756 * A073017 A171977 A059866

Adjacent sequences:  A110922 A110923 A110924 * A110926 A110927 A110928

KEYWORD

nonn,fini,full

AUTHOR

Leroy Quet Sep 23 2005

EXTENSIONS

Completed by Hans Havermann (gladhobo(AT)teksavvy.com), Sep 23 2005. Rechecked Oct 23, 2005

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 14 11:11 EST 2012. Contains 205616 sequences.