39365

Appears in sequences

• Numbers having four 8's in base 9.at n=5A043488
• a(0)=1, a(n) = 3*a(n-1) + 2; a(n) = 2*3^n - 1.at n=9A048473
• Number of alpha-beta evaluations in a tree of depth n and branching factor b=3.at n=18A060647
• Numbers of the form 3^m - 1 or 2*3^m - 1; i.e., the union of sequences A048473 and A024023.at n=19A062318
• a(n) is least odd integer not a partial sum of 1, 3, ..., a(n-1).at n=18A062547
• 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=18A072134
• Sum of terms in periodic part of continued fraction expansion of square root of -1 + 3^n.at n=17A077631
• Sequence of sums of alternating powers of 3.at n=18A079362
• Triangular array T of numbers generated by these rules: 1 is in T; and if x is in T, then 2x+1 and 3x+2 are in T.at n=54A094615
• Clique number of commuting graph of symmetric group S_n.at n=29A135908
• Numbers of the form i*9^j-1 (i=1..8, j >= 0).at n=37A140576
• Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, 0), (-1, -1, 1), (-1, 0, -1), (1, -1, 0), (1, 1, 0)}.at n=10A149084
• A048473 prefixed by two zeros.at n=11A154992
• a(n) = 54*n^2 - 1.at n=26A158656
• 2*3^(n-1)-(-1)^n.at n=9A174132
• a(n) = 54n^3 - 1.at n=8A181968
• Increasing sequence S generated by these rules: a(1)=1, and if x is in S then both 3x+2 and 4x+3 are in S.at n=40A191145
• a(n) = 6*9^n-1.at n=4A198963
• n such that A205592(n) > n.at n=19A205594
• Rectangular companion array to M(n,k), given in A239126, showing the end numbers N(n, k), k >= 1, for the Collatz operation (ud)^n, n >= 1, ending in an odd number, read by antidiagonals.at n=44A239127