Search Results

Let $\operatorname{wt}(n)$ be A000120, i.e. the number of $1$'s in binary expansion of $n$ (or the binary weight of $n$). Also let's consider $$\ell(n)=\left\lfloor\log_{2} n\right\rfloor$$ and $$T(n, …

First we need to set some binary functions: Let $$\ell(n)=\left\lfloor\log_2 n\right\rfloor$$ Let $\operatorname{wt}(n)$ be A000120, i.e., $1$'s-counting sequence: number of $1$'s in binary expansion …

Let $F(n)$ be A000045 i.e. Fibonacci numbers. Here $$ F(n) = F(n-1) + F(n-2), \\ F(0) = 0, F(1) = 1 $$ Let $a(n)$ be A345253 i.e. maximal Fibonacci tree: arrangement of the positive integers as labe …

Let F(n) be A000045 i.e. Fibonacci numbers. Here $$ F(n) = F(n-1) + F(n-2), \\ F(0) = 0, F(1) = 1 $$ Let $$ \ell(n) = \left\lfloor\log_2 n\right\rfloor $$ Let $$ T(n, k) = \left\lfloor\frac{n}{2^k} …

Let $F_n$ be A000045 (i.e., Fibonacci numbers). Here $$ F_n = F_{n-1} + F_{n-2}, \\ F_0 = 0, F_1 = 1, \\ F_{-n} = (-1)^{n-1}F_n $$ I conjecture that $$ F_{-n} = \left\lfloor\frac{n+1}{2}\right\rfloo …

Let F_n be A000045 (i.e., Fibonacci numbers). Here $$ F_n = F_{n-1} + F_{n-2}, \\ F_0 = 0, F_1 = 1 $$ Let $\operatorname{wt}(n)$ be A000120 (i.e., number of ones in the binary expansion of $n$). He …

Let $F_n$ be A000045 (i.e., Fibonacci numbers). Here $$ F_n = F_{n-1} + F_{n-2}, \\ F_0 = 0, F_1 = 1. $$ Let $C_n$ be A000108 (i.e., Catalan numbers). Here $$ C_n = \frac{1}{n+1}\binom{2n}{n}. $$ Let …

Let $F(n)$ be A000045 i.e. Fibonacci numbers. Here $$ F(n) = F(n-1) + F(n-2), \\ F(0) = 0, F(1) = 1 $$ Let $a(n)$ be A066258 i.e. $$ a(n) = F(n)^2F(n+1) $$ Let $b(n)$ be A345253 i.e. maximal Fibona …