29414
domain: N
Appears in sequences
- a(n) = C_n / 2 if n is even or ( C_n + C_((n-1)/2) ) / 2 if n is odd, where C = Catalan numbers (A000108).at n=10A007595
- Number of necklaces with 10 black beads and n-10 white beads.at n=12A032195
- Number of necklaces with 12 black beads and n-12 white beads.at n=10A032197
- Number of plane trees with even number of leaves.at n=10A071688
- Array of cycle count sequences for the table A073200.at n=66A073201
- Number of cycles in range [A014137(n-1)..A014138(n-1)] of permutation A089864.at n=11A089402
- Number of cycles in range [A014137(n-1)..A014138(n-1)] of permutation A082335/A082336.at n=12A089421
- Number of cycles in range [A014137(n-1)..A014138(n-1)] of permutation A069772.at n=11A089880
- Partial sums of A002522, starting at n=1.at n=43A145066
- Numbers k such that k and k+1 are the product of exactly four distinct primes.at n=34A318896
- E.g.f. satisfies A(x)^A(x) = 1/(1 - 2*x)^(1/2).at n=7A356909
- a(1) = 2; for n > 1, a(n) = a(n-1)*prime(n) if a(n-1) <= prime(n), otherwise a(n) = a(n-1) mod prime(n).at n=42A387775