[seqfan] Re: Significance of sequence relating powers of two and Fibonacci numbers

[Alonso Del Arte]

Thank you for explaining that, Max.

So what happened was that I got dyslexic about what I was trying to
calculate, and I was extremely surprised that such an obvious sequence was
not in the OEIS. The sequence that I was thinking about has indeed been in
the OEIS almost from the beginning. I have no basis to add the
miscalculated sequence.

Al

On Fri, Jul 7, 2023 at 10:50 PM M. F. Hasler via SeqFan <
seqfan at list.seqfan.eu> wrote:

> On Fri, Jul 7, 2023 at 3:46 PM Alonso Del Arte <> wrote:
>
> > a very loose upper bound for the number of numbers in A3714 less than 2^n
> > is 2^n itself.
>
> Allocating an array with that upper bound wastes A8466(*n*) array slots.
>
> (...)
>
> 0, 3, 11, 30, 73, 167, 368, 791, 1671, 3486, 7205, 14787, 30184,
>
> etc. (...).: 2^n − F(n + 3).
> > Does this sequence have any meaningful connection to the binary strings
> > problem?
> >
>
> As you wrote and one can read there,
> oeis.org/A8466 (n) := 2^n - Fibonacci(n+2)
> is indeed related to binary words in several ways,
> and your sequence  2^n - F(n+3)  is just  A8466(n+1) - 2^n,
> where 2^n is half of 2^(n+1) -- so it's related in a very similar way.
>
> - Maximilian
>
>
> > --
> > Seqfan Mailing list - http://list.seqfan.eu/
> >
>
> --
> Seqfan Mailing list - http://list.seqfan.eu/
>