43046720

Appears in sequences

• a(n) = 3^n - 1.at n=16A024023
• a(n) = 9^n-1.at n=8A024101
• a(n+1) = smallest number not containing any digits of a(n), working in base 3.at n=32A030439
• Dirichlet convolution of mu(n) with 3^(n-1).at n=16A034741
• a(n) = (n+1)^n - 1.at n=8A037205
• Numbers that are repdigits in base 3.at n=32A048328
• Duplicate of A037205.at n=8A060071
• Numbers of the form 3^m - 1 or 2*3^m - 1; i.e., the union of sequences A048473 and A024023.at n=32A062318
• Maximal term in Collatz-iteration started at 3^n-1.at n=15A087971
• XOR BINOMIAL transform of the powers of 3.at n=16A099888
• Inverse modulo 2 modulo transform of 9^n.at n=8A100472
• Inverse modulo 2 binomial transform of 3^n.at n=16A100736
• a(n) = 0^n + 3^n - 1.at n=16A103453
• a(n) = 3^n - (-1)^n.at n=16A105723
• a(n) = A000244(n) - A010684(n).at n=16A141317
• a(n) is the smallest integer not yet in the sequence with no common base-3 digit with a(n-1).at n=39A158928
• a(n) = n^8 - 1.at n=8A258809
• Numbers that are repdigits with length > 2 in more than two bases.at n=21A290869
• a(n) is the smallest number k > 1 such that k^n - 1 is divisible by 3^n.at n=15A316505
• a(n) is the smallest number k > 1 such that k^n - 1 is divisible by 3^n.at n=17A316505