|
Search: id:A065129
|
|
|
| A065129 |
|
Least m such that m/A003285(m) is n; or 0 if no such m exists. |
|
+0
1
|
| |
|
|
OFFSET
|
1,2
|
|
|
COMMENT
|
Conjecture: A003285(m) = even or A004613, if m is divisible by A003285(m).
|
|
MATHEMATICA
|
Do[k = 2; While[ k / Length[ Last[ ContinuedFraction[ Sqrt[k]]]] != n, k++ ]; Print[k], {n, 2, 10} ]
|
|
CROSSREFS
|
Cf. A004613, A003285.
Sequence in context: A095677 A011045 A002210 this_sequence A074758 A029671 A011224
Adjacent sequences: A065126 A065127 A065128 this_sequence A065130 A065131 A065132
|
|
KEYWORD
|
easy,more,nonn
|
|
AUTHOR
|
Naohiro Nomoto (n_nomoto(AT)yabumi.com), Nov 14 2001
|
|
|
Search completed in 0.002 seconds
|
