18896

Appears in sequences

• A problem in derangements.at n=5A013520
• Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, 0, 0), (0, -1, 1), (0, 1, 1), (1, 1, -1), (1, 1, 1)}.at n=7A151003
• Number of arrangements of 4 nonzero numbers x(i) in -n..n with the sum of trunc(x(i)/x(i+1)) equal to zero.at n=9A189547
• Number of tilings of a 5 X n rectangle using n pentominoes of shapes Y, U, X.at n=23A247268
• Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 7", based on the 5-celled von Neumann neighborhood.at n=29A270012
• Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 7", based on the 5-celled von Neumann neighborhood.at n=30A270012
• Positive even numbers which are neither of the form p + 2^m + 1 nor of the form p + 2^m - 1 with p prime.at n=28A270446
• Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 261", based on the 5-celled von Neumann neighborhood.at n=30A271062
• Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 337", based on the 5-celled von Neumann neighborhood.at n=30A271287