35072

Appears in sequences

• Expansion of (x-1)*(x^2-4*x-1)/(1-2*x)^2.at n=11A003232
• If there were a 9-dimensional unimodular lattice with minimal norm 2, this would be its theta series; however, no such lattice exists.at n=9A032800
• Revert transform of x*(1 - 3*x + x^2)/(1 - 2*x - x^2).at n=9A049123
• Smallest multiple of the n-th prime such that every partial sum is a square.at n=32A085039
• Triangle read by rows: T(n,k) is number of Dyck paths of semilength n and having leftmost valley at altitude k (if path has no valleys, then this altitude is considered to be 0).at n=59A097607
• Inverse of Riordan array (1/(1-x)^2,x(1-x)/(1+x)), A104698.at n=48A110271
• a(n) = (5*n^3+12*n^2+n+6)/6.at n=34A114211
• Sum of the lengths of the second ascents in all Dyck paths of semilength n+2.at n=8A114277
• Triangle read by rows: T(n,k) is the number of Grand Dyck paths of semilength n that have k double rises above the x-axis (n >= 1, k >= 0).at n=46A118964
• Triangle read by rows: T(n,k) is the number of Dyck paths of semilength n starting with exactly k consecutive pyramids. A pyramid in a Dyck path is a factor of the form U^j D^j (j>0), starting at the x-axis. Here U=(1,1) and D=(1,-1). This definition differs from the one in A091866.at n=66A127156
• Products of the 8th power of a prime and a distinct prime (p^8*q).at n=33A179668
• Number of 11X2 integer matrices with each row summing to zero, row elements in nondecreasing order, rows in lexicographically nondecreasing order, and the sum of squares of the elements <= 2*n^2 (number of collections of 11 zero-sum 2-vectors with total modulus squared not more than 2*n^2, ignoring vector and component permutations).at n=13A192712
• Triangular array: the fission of ((x+2)^n) by ((x+1)^n).at n=31A193846
• Triangular array: the fission of ((x+2)^n) by ((x+1)^n).at n=38A193846
• Mirror of the triangle A193846.at n=32A193847
• Mirror of the triangle A193846.at n=42A193847
• Number of (n+1) X (1+1) 0..5 arrays with every 2 X 2 subblock having its diagonal sum differing from its antidiagonal sum by 2, with no adjacent elements equal (constant-stress tilted 1 X 1 tilings).at n=4A234984
• Number of (n+1) X (5+1) 0..5 arrays with every 2 X 2 subblock having its diagonal sum differing from its antidiagonal sum by 2, with no adjacent elements equal (constant-stress tilted 1 X 1 tilings).at n=0A234988
• T(n,k) is the number of (n+1) X (k+1) 0..5 arrays with every 2 X 2 subblock having its diagonal sum differing from its antidiagonal sum by 2, with no adjacent elements equal (constant-stress tilted 1 X 1 tilings).at n=10A234991
• T(n,k) is the number of (n+1) X (k+1) 0..5 arrays with every 2 X 2 subblock having its diagonal sum differing from its antidiagonal sum by 2, with no adjacent elements equal (constant-stress tilted 1 X 1 tilings).at n=14A234991