44322

Appears in sequences

• Number of partitions satisfying 0 < cn(0,5) + cn(1,5) + cn(4,5).at n=41A039900
• G.f. A(x) satisfies: A(x) = exp( Sum_{k>=1} A(x^k)^5 * x^k / k ).at n=6A052781
• Smallest k such that both k-n and k+n are primes and there are no primes between them.at n=29A087378
• Number of lower triangular n X n arrays colored with integers 0 upwards introduced in row major order, with no element equal to any diagonal or antidiagonal neighbor, and containing the value n(n+1)/2-2.at n=23A211958
• Number of (n+2)X(2+2) 0..3 arrays with every 3X3 subblock row and column sum equal to 1 3 4 6 or 7 and every 3X3 diagonal and antidiagonal sum not equal to 1 3 4 6 or 7.at n=3A252204
• Number of (n+2)X(4+2) 0..3 arrays with every 3X3 subblock row and column sum equal to 1 3 4 6 or 7 and every 3X3 diagonal and antidiagonal sum not equal to 1 3 4 6 or 7.at n=1A252206
• T(n,k)=Number of (n+2)X(k+2) 0..3 arrays with every 3X3 subblock row and column sum equal to 1 3 4 6 or 7 and every 3X3 diagonal and antidiagonal sum not equal to 1 3 4 6 or 7.at n=11A252210
• T(n,k)=Number of (n+2)X(k+2) 0..3 arrays with every 3X3 subblock row and column sum equal to 1 3 4 6 or 7 and every 3X3 diagonal and antidiagonal sum not equal to 1 3 4 6 or 7.at n=13A252210
• a(n) is the smallest number m, such that m+n is the next prime and m-n is the previous prime.at n=28A282690
• Array read by antidiagonals: T(n,k) is the number of unlabeled oriented edge-rooted k-gonal 2-trees with n oriented polygons, n >= 0, k >= 2.at n=61A340814