131064

Appears in sequences

• 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=12A090860
• Number of bits required to represent binomial(2^n, 2^(n-1)).at n=17A112884
• a(n) = 8*(2^n - 1).at n=13A159741
• Fibonacci 15-step numbers, a(n) = a(n-1) + a(n-2) + ... + a(n-15).at n=18A220493
• Triangle of numerators of the coefficients t(n,k) in the formula B(2n) = -sum_{k=1..n-1} t(n,k)*B(2k)*B(2n-2k), where the B() are the even-indexed Bernoulli numbers.at n=27A228969
• 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=17A283350
• 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 633", based on the 5-celled von Neumann neighborhood.at n=17A283403
• Decimal representation of the diagonal from the corner to the origin of the n-th stage of growth of the two-dimensional cellular automaton defined by "Rule 637", based on the 5-celled von Neumann neighborhood.at n=16A290068
• Number of equivalence classes of 5-binomial complexity for binary words of length n. Or, equivalently, the number of distinct 5-decks of binary words of length n.at n=16A335891
• Numbers k such that k is a multiple of A163511(k).at n=20A364496