29364

Appears in sequences

• Number of unsensed genus 1 maps with n edges.at n=7A006387
• Number of partitions of n with equal number of parts congruent to each of 1, 2 and 3 (mod 4).at n=64A046769
• Numbers which are the sum of their proper divisors containing the digit 8.at n=21A059467
• Coefficient of q^2 in nu(n), where nu(0)=1, nu(1)=b and, for n>=2, nu(n)=b*nu(n-1)+lambda*(1+q+q^2+...+q^(n-2))*nu(n-2) with (b,lambda)=(1,1).at n=17A074082
• a(n) = n^2*(2*n^8 + 120*n^6 + 1806*n^4 + 7180*n^2 + 5067)/14175.at n=6A099197
• Row sums of A179318.at n=10A179381
• Number of partitions p of n such that the multiplicity of min(p)*max(p) is a part.at n=40A240498
• Maximum water retention of a number square of order n.at n=16A261347
• Number of 3-abelian equivalence classes of words of length n over a binary alphabet.at n=28A289657
• Numbers k such that k^2+1, (k+2)^2+1 and (k+6)^2+1 are prime.at n=44A302021
• a(0) = 1, a(n) = (2*n^5 + 20*n^3 + 23*n) * 2/15 for n>=1.at n=10A364429
• G.f. satisfies A(x) = 1 + x / (1 - x*A(x))^3.at n=9A365113
• Triangle read by rows: T(n,k) is the number of unsensed combinatorial maps with n edges and genus k, 0 <= k <= floor(n/2).at n=17A379439
• a(n) is the total number of paths starting at (0, 0), ending at (n, 0), consisting of steps (1, 1), (1, 0), (1, -2), and staying on or above y = -3.at n=12A379462