30208
domain: N
Appears in sequences
- a(n) = Sum_{i=1..floor((n+2)/4)} a(2i-1)*a(n-2i+1), with a(1)=a(3)=2 and a(2)=1.at n=13A024959
- Binomial transform of A000031.at n=11A054185
- a(n) = 2^n*(n^2 - n + 8)/8.at n=11A081908
- a(n) = 13 + floor(Sum_{j=1..n-1} a(j)/3).at n=27A120157
- Number of n X n binary arrays symmetric about the diagonal and under 90 degree rotation with all ones connected only in a 0110-1111-0110 pattern in any orientation.at n=25A146922
- Numbers of the form p^9*q where p and q are distinct primes.at n=15A179692
- Number of subsets of {1,...,n} containing {a,a+4} for some a.at n=15A209408
- Number of orbits of size 2n in vertex graph of Lucas cube Lambda_n.at n=29A250115
- Numbers that are the product of exactly 10 primes and are of the form prime(n) + prime(n + 1).at n=13A281927
- Number T(n,k) of tilings of a 2 X n X n box using k bricks of shape 2 X 1 X 1 and 2*(n^2-k) bricks of shape 1 X 1 X 1; triangle T(n,k), n>=0, 0<=k<=n^2, read by rows.at n=21A287152
- Number of connected dominating sets in the n-Apollonian network.at n=2A298105
- Triangle read by rows: T(n,k) = number of parking functions of length n whose lead number is k.at n=25A298592
- a(n) = Sum_{k=0..floor(n/2)} 2^(n-k) * binomial(k,n-2*k)^2.at n=13A387483