|
|
A010125
|
|
Continued fraction for sqrt(21).
|
|
4
|
|
|
4, 1, 1, 2, 1, 1, 8, 1, 1, 2, 1, 1, 8, 1, 1, 2, 1, 1, 8, 1, 1, 2, 1, 1, 8, 1, 1, 2, 1, 1, 8, 1, 1, 2, 1, 1, 8, 1, 1, 2, 1, 1, 8, 1, 1, 2, 1, 1, 8, 1, 1, 2, 1, 1, 8, 1, 1, 2, 1, 1, 8, 1, 1, 2, 1, 1, 8, 1, 1, 2, 1, 1, 8, 1, 1, 2, 1, 1, 8, 1, 1
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
0,1
|
|
LINKS
|
|
|
FORMULA
|
a(n) = gcd(Fibonacci(n), Fibonacci(n-6)), n > 0. - Gary Detlefs, Dec 29 2010
|
|
EXAMPLE
|
4.582575694955840006588047193... = 4 + 1/(1 + 1/(1 + 1/(2 + 1/(1 + ...)))). - Harry J. Smith, Jun 03 2009
|
|
MATHEMATICA
|
PadRight[{4}, 120, {8, 1, 1, 2, 1, 1}] (* Harvey P. Dale, May 16 2020 *)
|
|
PROG
|
(PARI) { allocatemem(932245000); default(realprecision, 14000); x=contfrac(sqrt(21)); for (n=0, 20000, write("b010125.txt", n, " ", x[n+1])); } \\ Harry J. Smith, Jun 03 2009
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,cofr,easy
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|