login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A244658
a(n) = x/(x1-floor(x1)) where x = sqrt(n) - floor(sqrt(n)), x1 = 1/x, a(n) = -1 if division by zero, a(n) = 0 for nonintegers.
2
-1, 1, 2, -1, 1, 2, 0, 4, -1, 1, 2, 3, 0, 0, 6, -1, 1, 2, 0, 4, 0, 0, 0, 8, -1, 1, 2, 0, 0, 5, 0, 0, 0, 0, 10, -1, 1, 2, 3, 4, 0, 6, 0, 0, 0, 0, 0, 12, -1, 1, 2, 0, 0, 0, 0, 7, 0, 0, 0, 0, 0, 0, 14, -1, 1, 2, 0, 4, 0, 0, 0, 8, 0, 0, 0, 0, 0, 0, 0, 16, -1, 1, 2, 3, 0, 0, 6, 0, 0, 9, 0, 0, 0, 0, 0, 0, 0, 0, 18, -1, 1, 2, 0, 4, 5
OFFSET
1,3
COMMENTS
Inspired by the square root of three poem in "Harold and Kumar" the movie. This operation can be done in iterations for which some n seem to give all integer results after iteration k >= 2. Some of them have periodic properties similar to that of the continued fraction method (but not exactly the same). When a(n) is arranged as a table read by rows, the row sums would be A062731. See illustrations in links.
EXAMPLE
For n = 3, x = sqrt(3) - floor(sqrt(3)) = 0.732050807..., x1 = 1/x = 1/0.732050807... = 1.366025403..., x1 - floor(x1) = 0.366025403..., a(3) = 0.732050807.../0.366025402... = 2.
PROG
(Small Basic)
For n=1 To 500
x=math.Power(n, .5)
y=x-math.Floor(x)
If y<>0 Then
x1=1/y
x2=1/(x1-math.Floor(x1))
a1=x2/x1
a2=a1-math.floor(a1)
If a2 > 0.999999 or a2 < 0.0000001 then
a=math.Round(a1)
TextWindow.Write(a+", ")
Else
TextWindow.Write(0+", ")'noninteger
Endif
Else
TextWindow.Write(-1+", ")'zero division, Square number
EndIf
EndFor
CROSSREFS
Cf. A062731.
Sequence in context: A376542 A344309 A358338 * A117586 A307988 A268917
KEYWORD
sign
AUTHOR
Kival Ngaokrajang, Jul 04 2014
STATUS
approved