|
Search: id:A110925
|
|
|
| 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, 1, 2, 4, 2, 7, 2, 7, 10, 5, 10, 4, 2, 7, 2, 9
(list; graph; listen)
|
|
|
OFFSET
|
1,4
|
|
|
LINKS
|
Leroy Quet, Home Page (listed in lieu of email address)
|
|
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: A154120 A021416 A094756 this_sequence A073017 A059866 A093895
Adjacent sequences: A110922 A110923 A110924 this_sequence A110926 A110927 A110928
|
|
KEYWORD
|
nonn,fini,full
|
|
AUTHOR
|
Leroy Quet Sep 23 2005
|
|
EXTENSIONS
|
Completed by Hans Havermann (pxp(AT)rogers.com), Sep 23 2005. Rechecked Oct 23, 2005
|
|
|
Search completed in 0.002 seconds
|
