43363
domain: N
Appears in sequences
- a(n) = 1 + 2 * least i such that A103507(i)=n+1, 0 if no such i exists.at n=35A103508
- Number of self-inverse permutations in S_n with longest increasing subsequence of length 5.at n=7A217325
- Tribonacci-like sequence a(n) = a(n-1) + a(n-2) + a(n-3) for n >= 3, with a(0) = 1, a(1) = 2, a(2) = 0.at n=19A276658
- Expansion of Sum_{k>=0} ( x / (1 - (k * x)^3) )^k.at n=10A360813
- a(n) = Sum_{k=0..floor(2*n/9)} binomial(2*n-6*k,3*k).at n=16A392405