18205

Appears in sequences

• Partitioning integers to avoid arithmetic progressions of length 3.at n=23A006999
• Number of length 6 walks on an n-dimensional hypercubic lattice starting and finishing at the origin and staying in the nonnegative part.at n=11A064046
• a(n) = (1/7)*Sum_{k=0..n} binomial(n,k)*Fibonacci(k)*7^k.at n=4A087584
• Triangle T(n,k) (n >= 2, 1 <= k <= n) read by rows: (1/2) times number of linearly inducible orderings of n points in k-dimensional Euclidean space.at n=48A087644
• Number of permutations of 1..n containing the relative rank sequence { 135624 } at any spacing.at n=3A159101
• Number of permutations of 1..n containing the relative rank sequence { 234615 } at any spacing.at n=3A159145
• Second pentagonal numbers that are interprime.at n=17A205881
• Number of cyclotomic cosets of 7 mod 10^n.at n=16A220019
• T(n,k)=Number of (n+1)X(k+1) 0..1 arrays x(i,j) with row sums sum{x(i,j), j=1..k+1} nondecreasing, and column sums sum{i^2*x(i,j), i=1..n+1} nondecreasing.at n=30A233301
• Number of (3+1)X(n+1) 0..1 arrays x(i,j) with row sums sum{x(i,j), j=1..n+1} nondecreasing, and column sums sum{i^2*x(i,j), i=1..3+1} nondecreasing.at n=5A233303
• a(n) = number of permutations of (1,2,...,n) producible by an ordered triple of distinct transpositions.at n=8A253171
• The number of overpartitions of n with restricted odd differences and smallest part both odd and overlined.at n=31A261037
• Number of n X 7 binary arrays with row sums nondecreasing and columns lexicographically nondecreasing.at n=3A267244
• T(n,k)=Number of nXk binary arrays with row sums nondecreasing and columns lexicographically nondecreasing.at n=48A267245
• Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 403", based on the 5-celled von Neumann neighborhood.at n=30A271809
• Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 502", based on the 5-celled von Neumann neighborhood.at n=33A272579
• Solutions to a certain congruence.at n=5A275880
• Number of nX4 0..1 arrays with every element equal to 1, 2 or 3 horizontally, vertically or antidiagonally adjacent elements, with upper left element zero.at n=4A300423
• Number of nX5 0..1 arrays with every element equal to 1, 2 or 3 horizontally, vertically or antidiagonally adjacent elements, with upper left element zero.at n=3A300424
• T(n,k)=Number of nXk 0..1 arrays with every element equal to 1, 2 or 3 horizontally, vertically or antidiagonally adjacent elements, with upper left element zero.at n=31A300427