68892

Appears in sequences

• Generating primitive Pythagorean triangles by using (n, n+1) gives perimeters for each n. This sequence lists the sum of these perimeters for each n triangles.at n=35A193068
• a(n) = sigma(n)*Pell(n), where sigma(n) = A000203(n), the sum of divisors of n.at n=10A204271
• Number of (n+1)X(3+1) 0..2 arrays colored with the maximum plus the lower median of every 2X2 subblock.at n=2A236714
• T(n,k) = Number of (n+1) X (k+1) 0..2 arrays colored with the maximum plus the lower median of every 2 X 2 subblock.at n=12A236719
• Number of length n+5 0..3 arrays with every six consecutive terms having two times the sum of some two elements equal to the sum of the remaining four.at n=10A249080
• a(n) = [x^n] (x^5 + 5*x^4 + 4*x^3 - 3*x + 1)/(x^2 + 2*x - 1)^2.at n=12A361732
• Number of 2n-step walks on square lattice starting and ending at the origin with first step north and avoiding early returns.at n=5A366924