18978

Appears in sequences

• Number of compositions of n such that no two adjacent parts are equal (these are sometimes called Carlitz compositions).at n=19A003242
• Numbers whose base-4 representation contains exactly three 0's and four 2's.at n=30A045056
• Number of configurations of the sliding block 8-puzzle that require a minimum of n moves to be reached, starting with the empty square at mid-side.at n=25A089483
• Least integer k > 0 such that A000041(k) is divisible by 2^n.at n=14A145523
• Least integer k > 0 such that A000041(k) is divisible by 2^n.at n=15A145523
• Least integer k > 0 such that A000041(k) is divisible by 2^n.at n=16A145523
• Number of distinct solutions of Sum_{i=1..2}(x(2i-1)*x(2i)) = 0 (mod n), with x() only in 2..n-2.at n=47A180814
• Number of n X 2 (0,1,2) arrays of permanents of 2 X 2 subblocks of some (n+1) X 3 binary array with rows and columns of the latter in lexicographically nondecreasing order.at n=12A227021
• Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 179", based on the 5-celled von Neumann neighborhood.at n=29A270624
• a(n) is the smallest k such that the 2-adic valuation of A000041(k) equals n.at n=16A278479
• Decimal representation of the x-axis, from the left edge to the origin, of the n-th stage of growth of the two-dimensional cellular automaton defined by "Rule 118", based on the 5-celled von Neumann neighborhood.at n=14A278953
• Solution of the complementary equation a(n) = a(n-1) + a(n-2) + b(n-1) + n + 1, where a(0) = 1, a(1) = 2, b(0) = 3, and (a(n)) and (b(n)) are increasing complementary sequences.at n=16A294549
• Number of nXn 0..1 arrays with every element unequal to 0, 1, 3, 4, 7 or 8 king-move adjacent elements, with upper left element zero.at n=6A316546
• Number of nX7 0..1 arrays with every element unequal to 0, 1, 3, 4, 7 or 8 king-move adjacent elements, with upper left element zero.at n=6A316551
• Number of parking functions of size n avoiding the patterns 132 and 321.at n=8A362595
• Number of integer partitions of n whose nonzero first differences are a submultiset of the parts.at n=48A364675