44976

Appears in sequences

• a(n) = floor(sqrt(a(n-1)^2 + a(n-2)^2)), a(1)=1, a(2)=3.at n=43A104803
• Number of n X n nonnegative integer arrays with each row and column an ascent sequence (interior element no greater than one plus up-steps preceding it) and the lower right element equal to n-1.at n=5A202729
• Number of nX6 nonnegative integer arrays each row and column an ascent sequence (interior element no greater than one plus up-steps preceding it) and the lower right element equal to min(n,6)-1.at n=5A202733
• T(n,k) = Number of n X k nonnegative integer arrays with each row and column an ascent sequence (interior element no greater than one plus up-steps preceding it) and the lower right element equal to min(n,k)-1.at n=60A202735
• Number of ways to reciprocally link elements of an n X n array either to themselves or to exactly two horizontal and antidiagonal neighbors, without consecutive collinear links.at n=6A220704
• Number of ways to reciprocally link elements of an n X 7 array either to themselves or to exactly two horizontal and antidiagonal neighbors, without consecutive collinear links.at n=6A220707
• Number of ways to reciprocally link elements of an 7Xn array either to themselves or to exactly two horizontal and antidiagonal neighbors, without consecutive collinear links.at n=6A220712
• Numbers n such that the three numbers pi(n), pi(n^2), and pi(n^3) are prime.at n=12A233463
• Third differences of A001521.at n=37A241576
• a(n) is the number of ways to partition a square n X n into five rectangles of different dimensions, without any straight cut spanning the entire square.at n=30A384208