64106
domain: N
Appears in sequences
- a(n) = L(n+1) + c(n) where L(k) = k-th Lucas number and c(n) is n-th number that is 1 or not a Lucas number.at n=21A022802
- Sum of n-th Lucas number greater than 3 and n-th number that is 1 or is not a Fibonacci number.at n=20A023489
- a(n) = b(n) + d(n), where b(n) = (n-th Lucas number > 3) and d(n) = (n-th non-Lucas number).at n=20A023495
- Convolution of A007054 (Super ballot numbers) with A000302 (powers of 4).at n=7A038679
- Let C(n) be the expected length of the longest carry chain when two n-bit binary numbers are added; sequence gives a(n) = 2^(2n-1)*C(n).at n=6A190868