65428

Appears in sequences

• Triangle read by rows: T(n,k) is the number of L-convex polyominoes of semiperimeter n, having k maximal rectangles (n >= 2, 1 <= k <= floor(n/2)). An L-convex polyomino is a convex polyomino in which any two cells can be connected by a path internal to the polyomino and which has at most 1 change of direction (i.e., one of the four orientations of the letter L). A maximal rectangle in an L-convex polyomino P is a rectangle included in P that is maximal with respect to inclusion.at n=38A181368
• Smallest number that is the largest value in the Collatz (3x + 1) trajectories of exactly n initial values. (a(n)=0 if no such number exists.)at n=25A233293
• Decimal representation of the diagonal from the corner to the origin of the n-th stage of growth of the two-dimensional cellular automaton defined by "Rule 249", based on the 5-celled von Neumann neighborhood.at n=15A287139