37088

Appears in sequences

• a(1) = 1; a(n+1) = sum of terms in continued fraction for the sum of the continued fractions, [a(1); a(2), a(3),...,a(n-1),a(n)] and [a(n); a(n-1), a(n-2),...,a(2), a(1)].at n=20A058081
• a(n) is the smallest value for which a(n), a(n)+1, ..., a(n)+n-1 are all lengths of hypotenuses of Pythagorean triangles.at n=17A098993
• a(n) is the smallest value for which a(n), a(n)+1, ..., a(n)+n-1 are all lengths of hypotenuses of Pythagorean triangles.at n=18A098993
• a(n) = least integer that begins a run of exactly n consecutive integers that can be the hypotenuse of a Pythagorean triangle.at n=18A099799
• 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, 1), (-1, 1, 1), (0, -1, 1), (0, 1, 1), (1, 1, -1)}.at n=9A149018
• Number of permutations of length n which avoid the patterns 4321 and 1324.at n=10A165524
• E.g.f. satisfies: A(x) = x + arcsin( A(x) )^2.at n=5A214431
• Number of (1+1) X (n+1) 0..3 arrays with nondecreasing x(i,j)-x(i,j-1) in the i direction and nondecreasing x(i,j)+x(i-1,j) in the j direction.at n=13A250878
• a(n) = (6^n + 4^n + 3*2^n)/8.at n=6A266797
• Nonunitary weird numbers: numbers that are nonunitary abundant but not nonunitary pseudoperfect.at n=6A327948
• Triangle read by rows: T(n,k) is the number of connected unlabeled tiered posets with n elements and height k.at n=47A361958