23535794707
domain: N
Appears in sequences
- a(n) = (1 - (-3)^n)/4.at n=23A014983
- a(n) = 2*a(n-1) + 3*a(n-2), with a(0)=0, a(1)=1.at n=23A015518
- Cyclotomic polynomials at x=-3.at n=23A020502
- Number of distinct paths of length 2n+1 along edges of a unit cube between two fixed adjacent vertices.at n=11A066443
- Largest prime factor of 3^n + 1.at n=23A074476
- Numbers of the form (3^s+1)/(3^r+1) for s > 1, 1 <= r <= s-1.at n=23A079672
- Primes of the form (3^k - (-1)^k)/4.at n=5A111010
- a(n) = (2 + (-1)^n + 3^n)/4.at n=23A122983
- a(n) = ceiling(9^n/n).at n=11A129793
- a(n) = 3*a(n-1) - a(n-3) + 3*a(n-4), starting with 1, 2, 6, 20.at n=22A132353
- a(n) is the least prime such that the multiplicative order of 3 mod a(n) equals n, or a(n)=1 if no such prime exists.at n=45A143663
- a(n) = (3^n+1)/(3-(-1)^n).at n=23A167205
- The rows of the binomial triangle reduced to balanced ternary lists encoded as decimal numbers.at n=23A182929
- Smallest prime factor of 3^n+1 having the form 2*k*n+1.at n=21A189241
- Primes of the form Phi_k(3), the k-th cyclotomic polynomial evaluated at 3.at n=17A211874
- Primes of the form Phi(phi(k),3), the phi(k)-th Cyclotomic polynomial evaluated at 3, where phi is the Euler totient function.at n=8A211875
- Smallest odd prime factor of 3^n + 1, for n > 1.at n=21A235365
- Largest prime factor of 9^n - 1.at n=22A274909
- a(n) = A015518(A032742(n)) / A015518(A054576(n)).at n=45A280691
- Row sums of triangle in A287879, divided by 2.at n=22A287880