63167

Appears in sequences

• Number of optimal binary prefix-free codes with n words all ending in 1.at n=50A055167
• Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, 1), (-1, 0, 0), (-1, 1, -1), (0, -1, 0), (1, 1, 0)}.at n=10A149117
• Numbers k such that 2^(k+1) == 1 (mod k).at n=37A187787
• Composite numbers n such that b^(n+1) == 1 (mod n) for every b coprime to n.at n=18A208728
• Sum of all the parts in the partitions of n into 5 parts.at n=43A308822