372519

Appears in sequences

• a(n) = 10 + floor(Sum_{j=1..n-1} a(j) / 2).at n=26A120138
• Triangular array read by rows: T(n,k) is the number of ways to partition an n-set into exactly k blocks and then partially order the blocks, n>=1, 1<=k<=n.at n=31A247231
• a(n) = p(2,n), where p(x,n) is the strong divisibility sequence of polynomials based on sqrt(2) as in A327320.at n=8A329007