|
Search: id:A080158
|
|
|
| A080158 |
|
Greedy frac multiples of Catalan's constant, G: a(1)=1, sum(n>0,frac(a(n)*x))=1 at x=G, where "frac(y)" denotes the fractional part of y. |
|
+0
1
|
|
| 1, 11, 107, 10579, 21158, 53014, 106028, 625708, 721157, 1442314, 2163471, 2884628, 3605785, 4326942
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
COMMENT
|
For definition of how the "Greedy Frac" sequence is defined, see other sequences in index.
|
|
EXAMPLE
|
a(3) = 107 since frac(1x) + frac(11x) + frac(107x) < 1, while frac(1x) + frac(11x) + frac(k*x) > 1 for all k>11 and k<107.
|
|
MAPLE
|
Digits := 1000: a := []: s := 0: x := evalf(Catalan): for n from 1 to 5000000 do: temp := evalf(s+frac(n*x)): if (temp<1.0) then a := [op(a), n]: print(n): s := s+evalf(frac(n*x)): fi: od: a;
|
|
CROSSREFS
|
Cf. A079938, A079939, A079940, A079941, A080142, A080157.
Sequence in context: A058715 A140617 A001721 this_sequence A071380 A142423 A125423
Adjacent sequences: A080155 A080156 A080157 this_sequence A080159 A080160 A080161
|
|
KEYWORD
|
more,nonn
|
|
AUTHOR
|
Mark Hudson (mrmarkhudson(AT)hotmail.com), Jan 31 2003
|
|
|
Search completed in 0.002 seconds
|
