|
|
A077057
|
|
Minimal positive solution a(n) of Diophantine equation a(n)^2 - a(n)*b(n) - G(n)*b(n)^2 = +1 or -1 with G(n) := A078358(n). The companion sequence is b(n)=A077058(n).
|
|
4
|
|
|
1, 2, 5, 3, 3, 27, 7, 37, 4, 4, 171, 22, 9, 14, 1193, 5, 5, 553, 16, 6173, 11, 45, 143, 849, 6, 6, 18339, 94, 1893, 103, 13, 33, 2353, 115, 12703, 7, 7, 67115, 701, 73, 59, 1891117, 15, 551427, 23, 49771, 39, 4105015, 8, 8, 24673, 41, 75585293, 25, 9095891, 989, 17, 386, 6445, 87, 771, 1385
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,2
|
|
COMMENTS
|
This equation can also be written as (2*a(n) - b(n))^2 - D(n)*b(n)^2 = +4 or -4 with D(n) := A077425(n) = 1 + 4*G(n).
This is from Perron's table (see reference p. 108, for n = 1..28) which gives the minimal x,y values which solve the above mentioned Diophantine equations.
|
|
REFERENCES
|
O. Perron, "Die Lehre von den Kettenbruechen, Bd.I", Teubner, 1954, 1957 (Sec. 30, Satz 3.35, p. 109 and table p. 108).
|
|
LINKS
|
|
|
FORMULA
|
|
|
MATHEMATICA
|
g[n_] := Ceiling[Sqrt[n]] + n - 1; r[n_] := Reduce[an > 0 && bn > 0 && (an ^2 - an*bn - g[n]*bn^2 == 1 || an^2 - an*bn - g[n]*bn^2 == - 1), {an, bn}, Integers] /. C -> c; ab[n_] := DeleteCases[ Flatten[ Table[{an, bn} /. {ToRules[r[n]]} // Simplify, {c[1], 0, 1}], 1], an | bn]; a[n_] := a[n] = Min[ab[n][[All, 1]]]; Table[Print[{n, a[n]}]; a[n], {n, 1, 62}] (* Jean-François Alcover, Oct 04 2012 *)
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
EXTENSIONS
|
a(9), a(33), a(54) corrected (after notice by Jean-François Alcover); a(58) through a(62) added. - Wolfdieter Lang, Oct 04 2012
|
|
STATUS
|
approved
|
|
|
|