25677

Appears in sequences

• Number of partitions of the n-th minimal number into distinct minimal numbers.at n=32A099388
• Triangle read by rows: T(n,k) is the number of hill-free Dyck paths of semilength n and having k UUDD's, where U=(1,1) and D=(1,-1) (0<=k<=floor(n/2), n>=2). A hill in a Dyck path is a peak at level 1.at n=47A105640
• Number of hill-free Dyck paths of semilength n, having no UUDD's, where U=(1,1) and D=(1,-1) (a hill in a Dyck path is a peak at level 1).at n=11A105641
• Numbers k for which 8*k+1, 8*k+5, 8*k+7 and 8*k+11 are primes.at n=31A123983
• Row sums of triangle A156837.at n=71A156838
• a(0) = a(1) = 1; a(n) = [x^n] Product_{k=1..n-1} 1/(1 - x^a(k))^a(k).at n=30A293807
• Numbers n such that (6k-1) for k=n, n+1, n+2, n+3 are all primes with no primes of the form (6k+1) in between.at n=23A296011
• Number of 2Xn 0..1 arrays with every element equal to 0, 1 or 3 horizontally or antidiagonally adjacent elements, with upper left element zero.at n=13A301885
• Integers which can be written in exactly three ways as sum of two distinct nonzero pentagonal numbers.at n=31A333013
• Expansion of A(x) satisfying A(x) = x + A(x)^2*(1 + A(x))^3.at n=7A361305