|
| |
|
|
A026352
|
|
[ n*tau ]+n+1.
|
|
13
| |
|
|
1, 3, 6, 8, 11, 14, 16, 19, 21, 24, 27, 29, 32, 35, 37, 40, 42, 45, 48, 50, 53, 55, 58, 61, 63, 66, 69, 71, 74, 76, 79, 82, 84, 87, 90, 92, 95, 97, 100, 103, 105, 108, 110, 113, 116, 118, 121, 124, 126, 129, 131, 134, 137, 139, 142, 144
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 0,2
|
|
|
COMMENTS
| a(n) = greatest k such that s(k) = n+1, where s = A026350.
Indices at which blocks (0;1) occur in infinite Fibonacci word; i.e. n such that A005614 (n)=0 and A005614(n+1)=1 - Benoit Cloitre (benoit7848c(AT)orange.fr), Nov 15 2003
Except for the first term, these are the numbers whose lazy Fibonacci representation (see A095791) includes both 1 and 2; thus A026352 is a subsequence of the lower Wythoff sequence, A001950. - Clark Kimberling (ck6(AT)evansville.edu), Jun 10 2004
a(n) = n-th number k whose lazy Fibonacci representation (as in A095791) has more summands than that of k-1. - Clark Kimberling (ck6(AT)evansville.edu), Jun 12 2004
a(n)=position of n-th 0 in A096270.
|
|
|
CROSSREFS
| Essentially same as A004957.
Complement of A026351.
Sequence in context: A184657 A157017 A004957 * A198084 A047399 A057349
Adjacent sequences: A026349 A026350 A026351 * A026353 A026354 A026355
|
|
|
KEYWORD
| nonn
|
|
|
AUTHOR
| Clark Kimberling (ck6(AT)evansville.edu)
|
| |
|
|
