134217720

Appears in sequences

• In the pile of coconuts problem, the number of coconuts that remain to be shared equally at the end of the process.at n=7A002022
• Number of Barlow packings with group P63/mmc(S) that repeat after 4n layers.at n=27A011946
• Number of ways of 4-coloring a map in which there is a central circle surrounded by an annulus divided into n-1 regions. There are n regions in all.at n=22A090860
• n*Jacobsthal(n).at n=24A093835
• a(n) = Sum_{k=0..n} floor(binomial(n,k)/(k+1)).at n=30A095718
• Number of functions f: {1, 2, ..., n} --> {1, 2, ..., n} such that f(1) != f(2), f(2) != f(3), ..., f(n-1) != f(n), f(n) != f(1).at n=7A118537
• a(n) = the smallest positive multiple of n that has exactly n 1's in its binary representation.at n=23A143115
• a(n) = A000079(n) - A153130(n).at n=27A153237
• a(n) = 8*(2^n - 1).at n=23A159741
• Row sums of triangle A166455.at n=26A166456
• Duplicate of A011946.at n=27A195095
• a(n) = n^9 - n.at n=8A196289
• Decimal representation of the n-th iteration of the "Rule 41" elementary cellular automaton starting with a single ON (black) cell.at n=13A266610
• Decimal representation of the x-axis, from the origin to the right edge, of the n-th stage of growth of the two-dimensional cellular automaton defined by "Rule 617", based on the 5-celled von Neumann neighborhood.at n=27A283350
• a(n) = (2^n - 1)*2^valuation(n, 2) for n > 0 and a(0) = 0.at n=24A335956
• a(n) = n^n*n - n.at n=8A345360
• a(n) is the number of trailing zeros in (2^n)!.at n=29A354463
• Numbers k such that A246601(k) > 2*k.at n=25A359084
• Where records occur in A385485.at n=15A385486