28697815

Appears in sequences

• a(n) = 1 + 2*3^(n-1) with a(0)=2.at n=16A052919
• a(n) is least odd integer not a partial sum of 1, 3, ..., a(n-1).at n=31A062547
• Second generation sequence in which each number is skipped that can be written as sum of distinct previous entries. To make the first generation we start with all natural numbers: this gives the powers of 2 (A000079). For the second generation we start with the natural numbers from which are removed the numbers of the first generation.at n=31A072134
• 2*3^n-(-1)^n.at n=15A081632
• Number of layers of dough separated by butter in successive foldings of croissant dough.at n=16A100702
• a(n) = 6*9^n+1.at n=7A199564
• T(n,k)=Number of (n+1)X(k+1) 0..3 arrays with no 2X2 subblock having equal diagonal elements or equal antidiagonal elements, and new values 0..3 introduced in row major order.at n=28A203878
• Inverse binomial transform of the continued fraction expansion of e.at n=28A306810