|
|
A010131
|
|
Continued fraction for sqrt(33).
|
|
3
|
|
|
5, 1, 2, 1, 10, 1, 2, 1, 10, 1, 2, 1, 10, 1, 2, 1, 10, 1, 2, 1, 10, 1, 2, 1, 10, 1, 2, 1, 10, 1, 2, 1, 10, 1, 2, 1, 10, 1, 2, 1, 10, 1, 2, 1, 10, 1, 2, 1, 10, 1, 2, 1, 10, 1, 2, 1, 10, 1, 2, 1, 10, 1, 2, 1, 10, 1, 2, 1, 10, 1, 2, 1, 10
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
0,1
|
|
LINKS
|
|
|
FORMULA
|
Multiplicative with a(2) = 2, a(2^e) = 10 for e >= 2, and a(p^e) = 1 for an odd prime p.
Dirichlet g.f.: zeta(s) * (1 + 1/2^(2*s-3) + 1/2^s). (End)
|
|
EXAMPLE
|
5.74456264653802865985061146... = 5 + 1/(1 + 1/(2 + 1/(1 + 1/(10 + ...)))). - Harry J. Smith, Jun 04 2009
|
|
MATHEMATICA
|
LinearRecurrence[{0, 0, 0, 1}, {5, 1, 2, 1, 10}, 100] (* or *) PadRight[{5}, 100, {10, 1, 2, 1}] (* Harvey P. Dale, Dec 31 2017 *)
|
|
PROG
|
(PARI) { allocatemem(932245000); default(realprecision, 17000); x=contfrac(sqrt(33)); for (n=0, 20000, write("b010131.txt", n, " ", x[n+1])); } \\ Harry J. Smith, Jun 04 2009
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,cofr,easy,mult
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|