118097

Appears in sequences

• Numerators of continued fraction convergents to sqrt(122).at n=3A041220
• Numerators of continued fraction convergents to sqrt(488).at n=3A041930
• a(0)=1, a(n) = 3*a(n-1) + 2; a(n) = 2*3^n - 1.at n=10A048473
• Number of alpha-beta evaluations in a tree of depth n and branching factor b=3.at n=20A060647
• Numbers of the form 3^m - 1 or 2*3^m - 1; i.e., the union of sequences A048473 and A024023.at n=21A062318
• a(n) is least odd integer not a partial sum of 1, 3, ..., a(n-1).at n=20A062547
• 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=20A072134
• Sum of terms in periodic part of continued fraction expansion of square root of -1 + 3^n.at n=19A077631
• Sequence of sums of alternating powers of 3.at n=20A079362
• 2*3^n-(-1)^n.at n=10A081632
• Clique number of commuting graph of symmetric group S_n.at n=32A135908
• Numbers of the form i*9^j-1 (i=1..8, j >= 0).at n=41A140576
• A048473 prefixed by two zeros.at n=12A154992
• a(n) = 29282*n^2 + 484*n + 1.at n=1A157614
• Number of (n+1)X(n+1) 0..2 arrays with all 2X2 subblock sums the same.at n=6A183994
• Number of (n+1) X 8 0..2 arrays with all 2 X 2 subblock sums the same.at n=6A184001
• 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=48A191145
• a(n) = 2*9^n-1.at n=5A198859
• 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=54A239127
• Numbers k such that half the numbers from 0 to k inclusive contain the digit "1".at n=12A344636