47334

Appears in sequences

• a(n) = K_4(n) = Sum_{k>=0} A090285(4,k)*2^k*binomial(n,k). a(n) = 2*(n^4+14*n^3+62*n^2+91*n+21)/3.at n=13A090296
• Triangle t(n,m)=A039757(n,m)+A039757(n,n-m) read by rows.at n=31A155719
• Triangle t(n,m)=A039757(n,m)+A039757(n,n-m) read by rows.at n=32A155719
• Pasquale's sequence: a(n) = 2a(n-1) + (-1)^n*floor(n/2), with a(1)=1.at n=15A177143
• Number of nX2 arrays of occupancy after each element moves to some horizontal, vertical or antidiagonal neighbor, with no occupancy greater than 2.at n=5A221230
• T(n,k)=Number of nXk arrays of occupancy after each element moves to some horizontal, vertical or antidiagonal neighbor, with no occupancy greater than 2.at n=22A221234
• T(n,k)=Number of nXk arrays of occupancy after each element moves to some horizontal, vertical or antidiagonal neighbor, with no occupancy greater than 2.at n=26A221234
• Numbers n for which there exists k < n such that A000203(k) = A000203(n) and A007947(k) = A007947(n), where A000203 gives the sum of divisors, and A007947 gives the squarefree kernel of n.at n=6A255335
• The least number k > A255334(n) for which A000203(k) = A000203(A255334(n)) and A007947(k) = A007947(A255334(n)), where A000203 gives the sum of divisors, and A007947 gives the squarefree kernel of n.at n=6A255423
• Numbers k such that k = rad(k) * sopfr(k), where rad(k) is the squarefree kernel of k and sopfr(k) the integer log of k.at n=21A280935
• Integers k such that k = Sum k/(p_i + j), where p_i are the prime factors of k (with multiplicity). Case j = 1.at n=33A380889
• Number of 4 element sets of distinct integer sided rectangles that fill an n X n square.at n=44A387171