19062
domain: N
Appears in sequences
- Triangle, read by rows, where the g.f. of row n, R_n(x), is a polynomial of degree n that satisfies: [x^k] R_{n+1}(x) = [x^k] (1 + x*R_n(x))^(n+1) for k=0..n+1, with R_0(x) = 1.at n=49A108990
- Number of (n+1)X3 0..2 arrays with every 2X2 subblock trace equal to exactly one or two horizontal and vertical neighbor 2X2 subblock traces.at n=2A187133
- Number of (n+1)X4 0..2 arrays with every 2X2 subblock trace equal to exactly one or two horizontal and vertical neighbor 2X2 subblock traces.at n=1A187134
- T(n,k)=Number of (n+1)X(k+1) 0..2 arrays with every 2X2 subblock trace equal to exactly one or two horizontal and vertical neighbor 2X2 subblock traces.at n=7A187140
- T(n,k)=Number of (n+1)X(k+1) 0..2 arrays with every 2X2 subblock trace equal to exactly one or two horizontal and vertical neighbor 2X2 subblock traces.at n=8A187140
- Sophie Germain 5-almost primes.at n=39A211162
- Sum of sums of omegas of the parts over all strict integer partitions of n.at n=46A325515
- a(n) = n*((2*n + 1)*(2*n^2 + 2*n + 3) - 3*(-1)^n)/24.at n=18A325517