32767

Appears in sequences

• a(n) = 2^n - 1. (Sometimes called Mersenne numbers, although that name is usually reserved for A001348.)at n=15A000225
• Numbers k such that x^k + x + 1 is irreducible over GF(2).at n=34A002475
• Divisors of 2^15 - 1.at n=7A003526
• Divisors of 2^45 - 1.at n=16A003550
• Number of nonzero coefficients of order n in Baker-Campbell-Hausdorff expansion.at n=17A005489
• Number of free subsets of multiplicative group of GF(2^n).at n=15A007230
• Stirling numbers of second kind S2(16,n).at n=1A011565
• Jacobsthal-Lucas numbers.at n=15A014551
• Strong pseudoprimes to base 32.at n=35A020258
• Nexus numbers (n+1)^15 - n^15.at n=1A022531
• a(n) = 8^n - 1.at n=5A024088
• Number of 8's in all partitions of n.at n=45A024792
• Super-5 Numbers (5 * n^5 contains substring '55555' in its decimal expansion).at n=8A032745
• Special connected numbers: minimal and maximal connected numbers (cf. A029827) of a given binary order, i.e., between two consecutive powers of 2.at n=21A036379
• Gaps of 6 in sequence A038593 (upper terms).at n=7A038652
• Number of 2n-bead balanced binary necklaces of fundamental period 2n which are equivalent to their reverse, complement and reversed complement.at n=31A045683
• a(n) = period of x^n + x + 1 over GF(2), i.e., the smallest integer m>0 such that x^n + x + 1 divides x^m + 1 over GF(2).at n=14A046932
• a(n) = T(2, n), where T is the array given by A047858.at n=12A047859
• Numbers that are repdigits in base 8.at n=35A048333
• Number of moves needed to solve an (n+1)-ring baguenaudier if two simultaneous moves of the two end rings are counted as one.at n=15A051049