|
| |
|
|
A075256
|
|
List of pairs of numbers (a < b) in the sequence {a,b}-> {Max[{a,b}]-Min[{a,b}],k*Min[{a,b}]} with k=3 and the first pair {a=1,b=2}.
|
|
3
| |
|
|
1, 2, 1, 3, 2, 3, 1, 6, 3, 5, 2, 9, 6, 7, 1, 18, 3, 17, 9, 14, 5, 27, 15, 22, 7, 45, 21, 38, 17, 63, 46, 51, 5, 138, 15, 133, 45, 118, 73, 135, 62, 219, 157, 186, 29, 471, 87, 442, 261, 355, 94, 783, 282, 689, 407, 846, 439, 1221, 782, 1317, 535, 2346, 1605, 1811, 206
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 1,2
|
|
|
COMMENTS
| Take any pair {a,b}. Each next pair is get by the rule {a,b} -> Sort[{Max[{a,b}]-Min[{a,b}],k*Min[{a,b}]]. Here k=3 and the first {a,b}={1,2}. For k = 2 there is a fixed point {a,b=2a}. For k > 2, are there any limits or cycles of the sequence {for some initial pair {a,b}?
|
|
|
REFERENCES
| a(n) = A075257(n) = A075256(2n-1), b(n) = A075258(n) = A075256(2n-1).
|
|
|
FORMULA
| a(n+1)=Min[{Max[{a(n), b(n)}]-Min[{a(n), b(n)}], k*Min[{a(n), b(n)}]}], b(n+1)=Max[{Max[{a(n), b(n)}]-Min[{a(n), b(n)}], k*Min[{a(n), b(n)}]}].
|
|
|
EXAMPLE
| 3rd pair is {2,3} because 2nd pair is {1,3}, Max[{a,b}]-Min[{a,b}] = 3 - 1 = 2, 3*Min[{a,b}] = 3*1 = 3.
|
|
|
MATHEMATICA
| ss=Table[0, {j, 100}]; s=ss[[1]]={1, 2}; Do[ss[[i]]=Sort[{Max[s]-Min[s], 3*Min[s]}]; s=ss[[i]], {i, 2, 100}]; Flatten[ss]
|
|
|
CROSSREFS
| Cf. A075257, A075258.
Sequence in context: A002487 A060162 A026730 * A001480 A110917 A070956
Adjacent sequences: A075253 A075254 A075255 * A075257 A075258 A075259
|
|
|
KEYWORD
| nonn
|
|
|
AUTHOR
| Zak Seidov (zakseidov(AT)yahoo.com), Sep 10 2002
|
| |
|
|
