28627200

Appears in sequences

• Number of circular permutations of {1, 2, ..., n}, where every next element in binary notation has ones at the same or adjacent positions of previous element's binary ones.at n=14A115507
• The smallest positive integer m such that m mod 2k < k for k = 1, 2, 3, ..., n.at n=32A362532
• The smallest positive integer m such that m mod 2k < k for k = 1, 2, 3, ..., n.at n=33A362532
• The smallest positive integer m such that m mod 2k < k for k = 1, 2, 3, ..., n.at n=34A362532
• The smallest positive integer m such that m mod 2k < k for k = 1, 2, 3, ..., n.at n=35A362532
• The smallest positive integer m such that m mod 2k < k for k = 1, 2, 3, ..., n.at n=36A362532
• E.g.f. A(x) satisfies A(x) = 1/( 1 - x * cosh(x * A(x)) )^2.at n=8A381377