40670

Appears in sequences

• Triangle read by rows: T(n,k) is the number of paths of length n in the first quadrant, starting at the origin, ending at height k and consisting of 2 kind of upsteps U=(1,1) (U1 and U2), 3 kind of flatsteps F=(1,0) (F1, F2 and F3) and 1 kind of downsteps D=(1,-1).at n=29A134426
• a(n) = ( (5 + 2*sqrt(2))^n - (5 - 2*sqrt(2))^n )/(4*sqrt(2)).at n=5A154340
• 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=29A193068
• Number of (n+1) X (7+1) 0..1 arrays with each 2 X 2 subblock having clockwise pattern 0000 0011 or 0101.at n=11A259221
• Row sums of irregular triangle A070168.at n=53A285098
• Expansion of the series e(q)*e(-q) (even coefficients only), where the series e(q) is Morier-Genoud and Ovsienko's q-analog of the real number e = exp(1).at n=16A392022