29124

Appears in sequences

• a(n) = 4*a(n-1) + n with n > 1, a(1)=1.at n=7A014825
• Alternating sum transform (PSumSIGN) of A000975.at n=15A034299
• Expansion of 1/((1-2*x)*(1-x^2)^2).at n=14A091919
• Row sums of A163357 and A163359.at n=33A163365
• Triangle T(n, k) read by rows: T(n, k)= (m*n-m*k+1)*T(n-1, k-1) + k*(m*k-(m-1))*T(n-1, k) where m = 1.at n=37A166960
• Number of arrangements of 4 nonzero numbers x(i) in -n..n with the sum of x(i)*x(i+1) equal to zero.at n=34A188250
• Number of 7Xn arrays with each row a permutation of 1..n having at least as many downsteps as the preceding row.at n=2A221629
• Number of length 4 1..(n+1) arrays with every leading partial sum divisible by 2, 3, 5, 7 or 11.at n=15A254951
• Number of nX5 0..1 arrays with every element equal to 0, 1, 2, 5 or 6 horizontally, diagonally or antidiagonally adjacent elements, with upper left element zero.at n=5A303179
• T(n,k) = Number of n X k 0..1 arrays with every element equal to 0, 1, 2, 5 or 6 horizontally, diagonally or antidiagonally adjacent elements, with upper left element zero.at n=50A303182
• Number of 6Xn 0..1 arrays with every element equal to 0, 1, 2, 5 or 6 horizontally, diagonally or antidiagonally adjacent elements, with upper left element zero.at n=4A303186
• Numbers with more than one Collatz tripling step whose odd Collatz trajectory does not contain primes.at n=30A319936
• Numbers k such that there are exactly four biquadratefree powerful numbers (A338325) between k^2 and (k+1)^2.at n=26A338391