9565939

Appears in sequences

• a(n) = 1 + 2*3^(n-1) with a(0)=2.at n=15A052919
• a(n) is least odd integer not a partial sum of 1, 3, ..., a(n-1).at n=29A062547
• 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=29A072134
• Number of layers of dough separated by butter in successive foldings of croissant dough.at n=15A100702
• 2*3^(n-1)-(-1)^n.at n=14A174132
• a(n) = 2*9^n+1.at n=7A199559
• Expansion of 1/((1 - x) * ((1 - x)^3 + x^3)).at n=27A307395