29737

Appears in sequences

• Numbers k such that sigma(k) = sigma(k+10).at n=30A015880
• T(n,n-5), array T as in A038792.at n=21A038795
• Consider the Diophantine equation x^3 + y^3 = z^3 - 1 (0 < x < y < z) or 'Fermat near misses'. Arrange solutions by increasing values of z. Sequence gives values of z.at n=22A050787
• A skew generalized Pascal triangle.at n=63A112906
• Convolution triangle of A006190.at n=38A132964
• Number of composite numbers between 2^n and 2^(n+1).at n=15A182095
• Array read by antidiagonals: T(n,k) = number of possible positions in standard Connect Four play on a board of height n and width k (n>=1, k>=1).at n=26A235610
• Number of n X 2 0..3 arrays with no element equal to zero plus the sum of elements to its left or zero plus the sum of elements above it or one plus the sum of the elements diagonally to its northwest, modulo 4.at n=11A240322
• Number of (n+1)X(4+1) 0..2 arrays with every 2X2 subblock ne-sw antidiagonal difference nondecreasing horizontally and nw+se diagonal sum nondecreasing vertically.at n=1A253745
• T(n,k)=Number of (n+1)X(k+1) 0..2 arrays with every 2X2 subblock ne-sw antidiagonal difference nondecreasing horizontally and nw+se diagonal sum nondecreasing vertically.at n=11A253749
• Number of (2+1)X(n+1) 0..2 arrays with every 2X2 subblock ne-sw antidiagonal difference nondecreasing horizontally and nw+se diagonal sum nondecreasing vertically.at n=3A253750
• G.f. = b(2)^2*b(6)/(x^7+x^6-x^5-x^2-x+1), where b(k) = (1-x^k)/(1-x).at n=18A266335
• Integer c such that (a^3 + b^3 - c^3)^2 = 1 where a,b,c are integers greater than 2.at n=42A281224
• Numbers k such that k!4 + 2^9 is prime, where k!4 = k!!!! is the quadruple factorial number (A007662).at n=32A291350
• a(n) = Sum_{k=0..n} binomial(4*n+k+1,n-k).at n=5A390333