|
Search: id:A127915
|
|
|
| A127915 |
|
a(1)=1, a(2)=2. For n >= 3, a(n) is the smallest positive integer not occurring earlier in the sequence such that floor(a(n)/a(n-1)) does not equal floor(a(n-1)/a(n-2)). |
|
+0
5
|
|
| 1, 2, 3, 6, 4, 5, 10, 7, 8, 16, 9, 11, 22, 12, 13, 26, 14, 15, 30, 17, 18, 36, 19, 20, 40, 21, 23, 46, 24, 25, 50, 27, 28, 56, 29, 31, 62, 32, 33, 66, 34, 35, 70, 37, 38, 76, 39, 41, 82, 42, 43, 86, 44, 45, 90, 47, 48, 96, 49
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
COMMENT
|
This sequence is a permutation of the positive integers.
|
|
MATHEMATICA
|
a = {1, 2}; For[n = 3, n < 60, n++, i = 3; While[Length[Intersection[{i}, a]] == 1 || Floor[i/a[[ -1]]] == Floor[a[[ -1]]/a[[ -2]]], i++ ]; AppendTo[a, i]]; a - Stefan Steinerberger (stefan.steinerberger(AT)gmail.com), Oct 16 2007
|
|
CROSSREFS
|
Sequence in context: A122347 A054076 A064470 this_sequence A072637 A125703 A019567
Adjacent sequences: A127912 A127913 A127914 this_sequence A127916 A127917 A127918
|
|
KEYWORD
|
more,nonn
|
|
AUTHOR
|
Leroy Quet (qq-quet(AT)mindspring.com), Apr 06 2007
|
|
EXTENSIONS
|
More terms from Stefan Steinerberger (stefan.steinerberger(AT)gmail.com), Oct 16 2007
|
|
|
Search completed in 0.002 seconds
|
