30818

Appears in sequences

• Permanent of a certain cyclic n X n (0,1) matrix.at n=10A000805
• Number of permutations p of [n] such that (n-p(i)+i) mod n >= 4 for all i.at n=6A004307
• Triangle read by rows: T(n,k) = number of permutations of [n] allowing i->i+j (mod n), j=0..k-1.at n=50A008305
• Smallest of 6 consecutive integers divisible respectively by 6 consecutive primes.at n=1A072722
• Smallest of 5 consecutive integers divisible respectively by 5 consecutive primes.at n=15A072730
• G.f. satisfies: A(x) = x + A(x*A(x)/(1-x)) with A(0)=0.at n=11A154836
• Volume of the last section of the set of partitions of n from the shell model of partitions version "Boxes".at n=21A206440
• Number of partitions of n in which any two parts differ by at most 9.at n=44A218511
• Number of length 3 0..n arrays with each partial sum starting from the beginning no more than two standard deviations from its mean.at n=30A244834
• Number of n X 4 nonnegative integer arrays with upper left 0 and every value within 3 of its king move distance from the upper left and every value increasing by 0 or 1 with every step right, diagonally se or down.at n=6A252934
• Number of nX7 nonnegative integer arrays with upper left 0 and every value within 3 of its king move distance from the upper left and every value increasing by 0 or 1 with every step right, diagonally se or down.at n=3A252937
• T(n,k)=Number of nXk nonnegative integer arrays with upper left 0 and every value within 3 of its king move distance from the upper left and every value increasing by 0 or 1 with every step right, diagonally se or down.at n=48A252938
• T(n,k)=Number of nXk nonnegative integer arrays with upper left 0 and every value within 3 of its king move distance from the upper left and every value increasing by 0 or 1 with every step right, diagonally se or down.at n=51A252938
• Partial sums of A299257.at n=34A299263
• Triangle T(n,k) giving the number of permutations pi of {1,2,...,n} such that for all i, pi(i) is not in {i, i+1, ..., i+k-1} (mod n), with 0 <= k <= n - 1.at n=49A321352
• Consider the figure made up of a row of n adjacent congruent rectangles, with diagonals of all possible rectangles drawn; a(n) = number of interior vertices where exactly two lines cross.at n=22A334701