177146

Appears in sequences

• a(n) = 3^n - 1.at n=11A024023
• a(n+1) = smallest number not containing any digits of a(n), working in base 3.at n=22A030439
• Numbers that are repdigits in base 3.at n=22A048328
• a(n) = n*3^n - 1.at n=8A060352
• Numbers of the form 3^m - 1 or 2*3^m - 1; i.e., the union of sequences A048473 and A024023.at n=22A062318
• a(n) = 3^n + (-1)^n - [1/(n+1)], where [] represents the floor function.at n=11A084182
• Maximal cycle lengths in a certain class of one-dimensional cellular automata.at n=20A085589
• Maximal cycle lengths in a certain class of one-dimensional cellular automata.at n=43A085589
• Maximal cycle lengths in a certain class of one-dimensional cellular automata.at n=43A085590
• a(n) = 3^n + (-1)^n.at n=11A102345
• a(n) = 0^n + 3^n - 1.at n=11A103453
• a(1)=1; then successively add 1, divide by 2, add 2 and then total up the last 4 terms.at n=41A112027
• Clique number of commuting graph of symmetric group S_n.at n=33A135908
• Clique number of commuting graph of alternating group A_n.at n=33A135909
• Numbers of the form i*9^j-1 (i=1..8, j >= 0).at n=42A140576
• a(n) is the smallest integer not yet in the sequence with no common base-3 digit with a(n-1).at n=29A158928
• Start at 1, then add the first term (which is one here) plus 1 for the second term; then add the second term plus 2 for the third term; then add the third term to the sum of the first and second term; this gives the fourth term. Restart the sequence by adding 1 to the fourth term, etc. (From a sixth grade math extra credit assignment).at n=31A167051
• Monotonic ordering of nonnegative differences 3^i-7^j, for 40>= i>=0, j>=0.at n=42A192153
• Monotonic ordering of nonnegative differences 3^i-8^j, for 40>= i>=0, j>=0.at n=41A192155
• Monotonic ordering of nonnegative differences 3^i-9^j, for 40>=i>=0, j>=0.at n=36A192157