34450

Appears in sequences

• a(n) = Sum_{i=1..floor((n+1)/4)} a(2*i-1) * a(n-2*i+1), with a(1)=2 and a(2)=a(3)=1.at n=15A024735
• Numbers that are the sum of 2 nonzero squares in exactly 6 ways.at n=31A025289
• Numbers that are the sum of 2 nonzero squares in 6 or more ways.at n=33A025297
• Numbers that are the sum of 2 distinct nonzero squares in exactly 6 ways.at n=31A025307
• Numbers that are the sum of 2 distinct nonzero squares in 6 or more ways.at n=33A025316
• Number of 7 X 7 binary matrices with n=0..49 ones up to row and column permutations.at n=13A053304
• Numbers m that are the hypotenuse of exactly 22 distinct integer-sided right triangles, i.e., m^2 can be written as a sum of two squares in 22 ways.at n=33A097103
• a(n) = n*(2*n^2 + 5*n + 3).at n=25A163815
• Averages of four consecutive cubes.at n=32A173965
• a(n) = number of n-lettered words in the alphabet {1, 2, 3, 4} with as many occurrences of the substring (consecutive subword) [1, 1] as of [1, 2].at n=8A211303
• G.f. satisfies: A(x) = A(x^2 + x^3)/(1-x).at n=22A251572
• G.f. A(x) satisfies: Product_{n=-oo..+oo} [1 + (-A(x))^n * (1 - (-A(x))^n)^n] = 2*x.at n=8A295131
• Number of minimal edge covers in the n-Plummer-Toft graph.at n=8A378701