29379

Appears in sequences

• a(n) = a(1) + a(2) + ... + a(n-1) + a(m) for n >= 4, where m = 2^(p+1) + 2 - n and p is the unique integer such that 2^p < n - 1 <= 2^(p+1), starting with a(1) = 1, a(2) = 2, and a(3) = 1.at n=15A049949
• Row sums of triangle A092422, which is generated from the even-numbered Fibonacci polynomials (A011973).at n=12A092423
• Exponential Riordan array, defining orthogonal polynomials related to permutations without double falls.at n=40A182822
• Number of distinct bags of distinct sequences of 1s and 2s such that the sum of all terms is n.at n=15A200544
• Number of ways to select 4 numbers from the set of the first n natural numbers avoiding 3-term arithmetic progressions.at n=28A300760
• a(n) is the number of edges formed by n-secting the angles of a heptagon.at n=37A335759