1594322

Appears in sequences

• a(n) = 3^n - 1.at n=13A024023
• a(n+1) = smallest number not containing any digits of a(n), working in base 3.at n=26A030439
• Numbers that are repdigits in base 3.at n=26A048328
• Numbers of the form 3^m - 1 or 2*3^m - 1; i.e., the union of sequences A048473 and A024023.at n=26A062318
• a(n) = 3^n + (-1)^n - [1/(n+1)], where [] represents the floor function.at n=13A084182
• a(n) = 3^n + (-1)^n.at n=13A102345
• a(n) = 0^n + 3^n - 1.at n=13A103453
• Solutions to abs(sigma(x+1) - sigma(x)) = 2. Divisor sums of x and its neighbor x+1 differ from each other by 2.at n=6A112645
• Special solutions to abs(sigma(x+1) - sigma(x)) = 2 where x + 1 = 3^y.at n=3A112646
• Semiprime nearest to 3^n. In case of a tie, choose the smaller.at n=13A117416
• a(n) = 2*A132357(n).at n=12A135263
• Clique number of commuting graph of symmetric group S_n.at n=39A135908
• Clique number of commuting graph of alternating group A_n.at n=39A135909
• a(n) is the smallest integer not yet in the sequence with no common base-3 digit with a(n-1).at n=33A158928
• 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=37A167051
• a(n) = 3*9^n-1.at n=6A198960
• a(n) = sigma(2*n^4) - sigma(n^4).at n=26A224903
• Numbers n such that sigma(n+1) - sigma(n) divides n.at n=18A225211
• Smallest b > 1 such that there exists an odd prime p with p < b such that b^(p-1) == 1 (mod p^n).at n=12A267488
• a(n) = A015518(A032742(n)) / A015518(A054576(n)).at n=51A280691