26137

Appears in sequences

• a(n) = a(n-1) + a(m) for n >= 4, where m = 2*n - 2 - 2^(p+1) and p is the unique integer such that 2^p < n - 1 <= 2^(p+1), starting with a(1) = 1, a(2) = 2, and a(3) = 1.at n=38A050043
• List of codewords in binary lexicode with Hamming distance 7 written as decimal numbers.at n=26A075937
• Triangle read by rows: T(n,k) is the number of Grand Dyck paths of semilength n that have k double rises above the x-axis (n >= 1, k >= 0).at n=48A118964
• Egyptian fraction representation for the cube root of 30.at n=2A132505
• a(n) = 24*n^2 + 1.at n=33A158547
• a(n) = 54*n^2 + 1.at n=22A158646
• Number of 2n-bead necklaces labeled with numbers 1..n allowing reversal, with neighbors differing by exactly 1.at n=9A208666