

A026352


a(n) = floor(n*tau)+n+1.


14



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;
text;
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, Nov 15 2003
Except for the first term, these are the numbers whose lazy Fibonacci representation (see A095791) includes both 1 and 2; thus this sequence is a subsequence of the lower Wythoff sequence, A000201.  Clark Kimberling, Jun 10 2004; Anumber typo corrected by Nathan Fox, May 03 2014
a(n) = nth number k whose lazy Fibonacci representation (as in A095791) has more summands than that of k1.  Clark Kimberling, Jun 12 2004
a(n) = position of nth 0 in A096270.


LINKS

Table of n, a(n) for n=0..55.
U. Larsson, N. Fox, An Aperiodic Subtraction Game of NimDimension Two, Journal of Integer Sequences, 2015, Vol. 18, #15.7.4.


PROG

(PARI) a(n) = floor(n*(sqrt(5)+1)/2) + n + 1; \\ Michel Marcus, Sep 15 2016


CROSSREFS

Essentially same as A004957.
Subsequence of A000201.
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, Dec 11 1999


STATUS

approved



