31180

Appears in sequences

• a(n) = Sum_{k=0..6} binomial(n,k).at n=18A008859
• Sum of the lengths of the cycle types of the permutation created by length sorting on the partitions of n.at n=38A036056
• Consider the Diophantine equation x^3 + y^3 = z^3 + 1 (1<x<y<z) or 'Fermat near misses'. Arrange solutions by increasing values of z (see A050791), and increasing values of y in case of ties. Sequence gives values of y.at n=20A050793
• a(n) = Sum_{k=0..n} binomial(3*n,k).at n=6A066380
• Number of compositions of n where differences between neighboring parts are in {-1,1}.at n=48A173258
• G.f.: A(x) = Sum_{n>=0} x^(n*(n+1)/2) / Product_{k=1..n} (1-x^k)^(n-k+1).at n=24A206139
• Number of length n+5 0..4 arrays with no six consecutive terms having the maximum of any two terms equal to the minimum of the remaining four terms.at n=1A249956
• T(n,k)=Number of length n+5 0..k arrays with no six consecutive terms having the maximum of any two terms equal to the minimum of the remaining four terms.at n=11A249960
• Number of length 2+5 0..n arrays with no six consecutive terms having the maximum of any two terms equal to the minimum of the remaining four terms.at n=3A249962
• Partial sums of A169707.at n=43A253098
• Expansion of b(2)*b(6)*b(10)/(1 - x - x^2 - x^4 - x^5 + x^11 + x^12 + x^14), where b(k) = (1-x^k)/(1-x).at n=15A266354
• Number T(n,k) of set partitions of [n] having exactly k triples (t,t+1,t+2) such that t+i is in block b+i for some b; triangle T(n,k), n>=0, 0<=k<=max(0,n-2), read by rows.at n=40A271206
• Irregular table read by rows: T(n,k) is the number of permutations in S_n that have exactly k occurrences of the pattern 2413. 0 <= k <= A342854(n).at n=49A342860
• Square array T(n,k), n >= 0, k >= 0, read by antidiagonals downwards, where T(n,k) = Sum_{j=0..n} k^j * j^k.at n=39A368486
• a(n) = number of subsets of {1,2,...,n} that contain more primes than nonprimes.at n=18A369780