86093441

Appears in sequences

• a(0)=1, a(n) = 3*a(n-1) + 2; a(n) = 2*3^n - 1.at n=16A048473
• Number of alpha-beta evaluations in a tree of depth n and branching factor b=3.at n=32A060647
• Numbers of the form 3^m - 1 or 2*3^m - 1; i.e., the union of sequences A048473 and A024023.at n=33A062318
• a(n) is least odd integer not a partial sum of 1, 3, ..., a(n-1).at n=32A062547
• 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=32A072134
• Sum of terms in periodic part of continued fraction expansion of square root of -1 + 3^n.at n=31A077631
• Sequence of sums of alternating powers of 3.at n=32A079362
• 2*3^n-(-1)^n.at n=16A081632
• a(n) = 2n^(n-1) - 1.at n=8A093460
• n-th row of the following triangle contains n terms of an arithmetic progression with the first term 1 such that the sum is the least possible n-th power. Sequence contains the leading diagonal.at n=8A093844
• A048473 prefixed by two zeros.at n=18A154992
• a(n) = 2*9^n-1.at n=8A198859