30142

Appears in sequences

• a(n)=9*a(n-1)-7*a(n-2), a(0)=1, a(1)=7 .at n=5A147839
• 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, -1, 1), (-1, 1, 0), (0, 1, 1), (1, 0, 0), (1, 1, -1)}.at n=8A150258
• Eight rooks and one berserker on a 3 X 3 chessboard. G.f.: 1/(1 - 4*x - 3*x^2 + 6*x^3).at n=7A180146
• Number of partitions p of 2n-1 such that n - (number of parts of p) is a part of p.at n=24A238641
• a(n) = A273059(4n+2).at n=30A275918
• Integers x such that [f(0), f(f(0)), ..., f(...f(0)...)] is a permutation of [0, 1, ..., k-1], where k is the number of digits in x and f(a) denotes the 0-based index of the first occurrence of the substring a in x.at n=22A307620
• Number of cycles in the n-dipyramidal graph.at n=17A307621
• Number of non-isomorphic set multipartitions (multisets of sets) of weight n with empty intersection.at n=12A319748
• Number of non-isomorphic multiset partitions of weight n where the nonzero entries of the incidence matrix are all distinct.at n=21A321661
• Number of triangular regions into which a figure made up of a row of n adjacent congruent rectangles is divided upon drawing diagonals of all possible rectangles.at n=23A324042