22431

Appears in sequences

• Binomial transform of Fine's sequence A000957: 1, 0, 1, 2, 6, 18, 57, 186, ...at n=9A033321
• Rounded base-2 logarithm of A082128(n).at n=28A082129
• Triangle T(n,k), 0 <= k <= n, read by rows, defined by: T(0,0) = 1, T(n,k) = 0 if n<k, T(n,0) = T(n-1,0) + T(n-1,1) and for k >= 1: T(n,k) = T(n-1,k-1) + x*T(n-1,k) + T(n-1,k+1) with x = 3.at n=45A110877
• Number of partitions of n in which each part, with the possible exception of the largest, occurs at least twice.at n=49A116931
• Triangle read by rows: T(n,k) is the number of skew Dyck paths of semilength n and having height of the last peak equal to k (1 <= k <= n).at n=45A128745
• Riordan array (f(x), x*f(x)) where f(x) is the g.f. of A033321.at n=45A171486
• Sequence defined by the recurrence formula a(n+1)=sum(a(p)*a(n-p)+k,p=0..n)+l for n>=1, with here a(0)=1, a(1)=9, k=0 and l=1.at n=6A177130
• T(n,k)=Number of length n sequences p(i=0..n-1) with 0<=p(i)<=i and having exactly k maxima.at n=44A181229
• Generalized Riordan array based on the binomial transform of the Fine's numbers A000957.at n=45A187914
• Number of integer partitions of n of even rank.at n=41A340601
• Numbers k such that (20^k + 1)^2 - 2 is prime.at n=10A364081
• Number of free linear midpoint-free polycubes of size n, identifying rotations and reflections.at n=26A368032