32070

Appears in sequences

• Partial sums of A026905; the convolution of the natural numbers with the partition function.at n=23A085360
• Number of Dyck paths of semilength n avoiding the pattern U^4 D^4 U D.at n=26A225691
• Number of (n+1) X (2+1) 0..4 arrays with every 2 X 2 subblock having its diagonal sum differing from its antidiagonal sum by 2 (constant-stress 1 X 1 tilings).at n=2A234163
• Number of (n+1) X (3+1) 0..4 arrays with every 2 X 2 subblock having its diagonal sum differing from its antidiagonal sum by 2 (constant-stress 1 X 1 tilings).at n=1A234164
• T(n,k) is the number of (n+1) X (k+1) 0..4 arrays with every 2 X 2 subblock having its diagonal sum differing from its antidiagonal sum by 2 (constant-stress 1 X 1 tilings).at n=7A234169
• T(n,k) is the number of (n+1) X (k+1) 0..4 arrays with every 2 X 2 subblock having its diagonal sum differing from its antidiagonal sum by 2 (constant-stress 1 X 1 tilings).at n=8A234169
• Number of length n+5 0..5 arrays with no six consecutive terms having two times the sum of any two elements equal to the sum of the remaining four.at n=0A249230
• T(n,k)=Number of length n+5 0..k arrays with no six consecutive terms having two times the sum of any two elements equal to the sum of the remaining four.at n=10A249233
• Number of length 1+5 0..n arrays with no six consecutive terms having two times the sum of any two elements equal to the sum of the remaining four.at n=4A249234
• Least positive integer k such that prime(k)-k, prime(k)+k, prime(k*n)-k*n, prime(k*n)+k*n, prime(k)+k*n and prime(k*n)+k are all prime.at n=42A259492
• Number of n X 6 0..1 arrays with the number of 1's horizontally or antidiagonally adjacent to some 0 two less than the number of 0's adjacent to some 1.at n=2A293085
• T(n,k) = Number of n X k 0..1 arrays with the number of 1's horizontally or antidiagonally adjacent to some 0 two less than the number of 0's adjacent to some 1.at n=30A293087
• Number of 3 X n 0..1 arrays with the number of 1's horizontally or antidiagonally adjacent to some 0 two less than the number of 0's adjacent to some 1.at n=5A293089
• Numbers k such that (89*10^k - 539)/9 is prime.at n=19A294913
• Numbers k such that F(k)*F(k+1) + F(k+2) is a prime, where F = A000045 (Fibonacci numbers).at n=35A305414