3188645

Appears in sequences

• a(0)=1, a(n) = 3*a(n-1) + 2; a(n) = 2*3^n - 1.at n=13A048473
• Number of alpha-beta evaluations in a tree of depth n and branching factor b=3.at n=26A060647
• Numbers of the form 3^m - 1 or 2*3^m - 1; i.e., the union of sequences A048473 and A024023.at n=27A062318
• a(n) is least odd integer not a partial sum of 1, 3, ..., a(n-1).at n=26A062547
• a(n) = n*9^n - 1.at n=5A064755
• 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=26A072134
• Sum of terms in periodic part of continued fraction expansion of square root of -1 + 3^n.at n=25A077631
• Sequence of sums of alternating powers of 3.at n=26A079362
• Clique number of commuting graph of symmetric group S_n.at n=41A135908
• A048473 prefixed by two zeros.at n=15A154992
• 2*3^(n-1)-(-1)^n.at n=13A174132
• a(n) = 6*9^n-1.at n=6A198963
• a(0) = 1, a(1) = 3, a(2) = 13; for n >= 2, a(n+1) = 2*3^((a(n)-1)/4) - 1.at n=4A377082