131088

Appears in sequences

• a(n) = 2^n + n - 1.at n=17A052944
• Replace 0 with 0000 in binary representation of n.at n=33A084473
• a(n) = (1/n)*Sum_{k=1..n} k*2^gcd(n,k).at n=16A102688
• Row sums of triangle A132735.at n=17A132736
• a(1)=1, a(n) = a(n-1) + n^3 if n odd, a(n) = a(n-1) + n^1 if n is even.at n=31A140153
• Positive integers with the same number of 1s in base 10 and base 2.at n=17A153115
• Numbers of the form A019434(i) + A000668(j).at n=27A168335
• a(n) = 16*(2^n + 1).at n=13A175162
• Number of binary necklaces of n beads for which a cut exists producing a palindrome.at n=35A185333
• Number of binary necklaces of 2n beads for which a cut exists producing a palindrome.at n=17A185376
• a(n) = Sum_{x_1|n, x_2|n, ... , x_n|n} gcd(x_1,x_2, ... ,x_n).at n=16A344140
• a(n) = Sum_{k=1..n} tau(gcd(k,n))^gcd(k,n), where tau(n) is the number of divisors of n.at n=16A344194