65553

Appears in sequences

• a(n) = 2^n + n + 1.at n=16A005126
• a(1) = 1, a(2n) = 16a(n), a(2n+1) = a(2n)+1.at n=19A033052
• a(n) = Fibonacci(n) AND Fibonacci(n+1).at n=25A051122
• a(n) = Sum_{d|n} d*2^(n/d - 1).at n=17A054599
• a(n) = Sum_{d|n, d odd} d*2^(n/d - 1), a(0)=0.at n=17A054601
• a(n) = Sum_{d|n} d*2^(n-d).at n=16A090879
• a(n) = (-1)^n * coefficient of x^n in Sum_{k>=1} x^(k-1)/(1+4*x^k).at n=8A101562
• Define F(n) = 2^(2^n)+1 = the n-th Fermat number, M(n) = 2^n-1 = the n-th Mersenne number. Then a(n) = F(n)+M(n)+1=2^(2^n)+1+2^n-1+1 = 2^(2^n)+2^n+1 = F(n)+2^n.at n=4A119561
• Number of non-Fibonacci parts in the last section of the set of partitions of n.at n=46A144118
• Odd positive integers a(n) such that for every odd integer m>=7 there exists a unique representation of the form m=a(p)+2a(q)+4a(r).at n=34A147845
• Number of nX2 1..6 arrays containing at least one of each value, all equal values connected, and rows considered as a single number in nondecreasing order.at n=5A166779
• Numbers of the form 2^k + k + 1 that are the product of two distinct primes.at n=4A176071
• Self-composition of binary encoding of GF(2) polynomial.at n=21A193145
• Numerator of (0 followed by A005126(n)= 2, 4, 7, ...)/2^n.at n=17A271573
• Positions of 0 in A288132; complement of A288134.at n=17A288133
• a(n) = Sum_{d|n} d^(2*d).at n=3A308696
• Square array A(n,k), n >= 1, k >= 0, read by antidiagonals, where A(n,k) is Sum_{d|n} d^(k*d).at n=18A308698
• a(n) = Sum_{d|n} 4^(d-1).at n=8A339684
• a(n) = Sum_{d|n} 2^(d-1) * binomial(d+n/d-1,d).at n=16A357041
• a(n) = (1/2) * Sum_{d|n} (2*d)^(n/d).at n=16A359733