38403

Appears in sequences

• Sum along upward diagonal of Pascal triangle from (but not including) halfway point.at n=24A010758
• a(n) = T(n, 2*n-10), T given by A027926.at n=12A027933
• a(n) = T(2n+1, n+4), T given by A027935.at n=5A027944
• Greatest number in row n of array T given by A027935.at n=17A027945
• Partial sums of A053295.at n=10A053296
• G.f. satisfies: A(x) = 1 + x*A(x) + x^3*A(x)^3.at n=14A071879
• G.f.: A(x) = Sum_{n>=0} x^n*A(x)^A001969(n+1), where A001969 lists numbers with an even number of 1's in their binary expansion.at n=7A195262
• Number of length-4 0..n arrays with no adjacent pair x,x+1 repeated.at n=13A269657
• Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 149", based on the 5-celled von Neumann neighborhood.at n=38A270319
• For 1<=x<=n, 1<=y<=n, with gcd(x,y)=1, write 1 = gcd(x,y) = u*x+v*y with u,v minimal; a(n) = sum of the values of u^2+v^2.at n=31A345431