19297

Appears in sequences

• a(n) = 839*n.at n=23A135639
• 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), (1, -1, 0), (1, 1, -1), (1, 1, 1)}.at n=7A151011
• Sum of positive Dyson's ranks of all partitions of n.at n=30A209616
• Number of n X 4 0..1 arrays with no element equal to more than two of its horizontal, diagonal or antidiagonal neighbors and with new values introduced in order 0 sequentially upwards.at n=10A281465
• Numbers whose Collatz trajectories cross their initial values a record number of times.at n=23A319738
• a(n) is the number of unlabeled rank-3 graded lattices with 4 coatoms and n atoms.at n=30A322599
• Irregular table read by rows, T(n, k) is the rank of the k-th Seidel permutation of {1,...,n}, permutations sorted in lexicographical order.at n=35A347600
• Number of partitions of n such that 5*(smallest part) = (number of parts).at n=61A350897
• Number of vertices formed in a hexagon by straight line segments when connecting the n-1 points between each corner that divide each edge into n equal parts to the n-1 points on the edge on the opposite side of the hexagon.at n=9A367663
• Numbers k such that Fibonacci(k) has a Fibonacci number of 1's in its binary representation.at n=56A382053