27325
domain: N
Appears in sequences
- a(n) = s(n+3)/3, where s is A024737.at n=9A024738
- a(n) = Sum_{i=1..floor((n+2)/4)} a(2i-1)*a(n-2i+1), with a(1)=3 and a(2)=a(3)=1.at n=11A024958
- 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=15A098993
- a(n) = least integer that begins a run of exactly n consecutive integers that can be the hypotenuse of a Pythagorean triangle.at n=15A099799
- Row sums in A100781.at n=24A100784
- Number of partitions of n containing a clique of size 2.at n=39A183559
- Number of 3 X n arrays of the minimum value of corresponding elements and their horizontal, diagonal or antidiagonal neighbors in a random, but sorted with lexicographically nondecreasing rows and columns, 0..1 3 X n array.at n=28A219520
- Smallest m such that gcd(A227113(m+1), A227113(m)) = n.at n=29A227289
- Number of (2+2)X(n+2) 0..3 arrays with every 3X3 subblock row and diagonal sum equal to 0 3 5 6 or 7 and every 3X3 column and antidiagonal sum not equal to 0 3 5 6 or 7.at n=14A252386
- Numbers n such that the decimal expansions of both n and n^2 have 2 as smallest digit and 7 as largest digit.at n=12A257123
- Numbers k such that the ring of integers of Q(2^(1/k)) is not Z[2^(1/k)].at n=31A342390
- Coefficients in the power series A(x) such that: x*A(x)^4 = Sum_{n=-oo..+oo} (-1)^n * x^(n*(n+1)) * A(x)^n.at n=6A357224