581130733

Appears in sequences

• a(n) = (3^n - 1)/2.at n=19A003462
• Number of free subsets of multiplicative group of GF(3^n).at n=18A007231
• Cyclotomic polynomials at x=3.at n=19A019321
• a(n) = 2*a(n-1) + 3*a(n-2), a(0) = a(1) = 1.at n=19A046717
• Numbers that are repdigits in base 3.at n=37A048328
• Sum of the divisors of n^n (A000312).at n=9A062727
• Zsigmondy numbers for a = 3, b = 1: Zs(n, 3, 1) is the greatest divisor of 3^n - 1^n (A024023) that is relatively prime to 3^m - 1^m for all positive integers m < n.at n=18A064079
• Binomial transform of Jacobsthal gap sequence (A080924).at n=19A080925
• a(n)=3*(3^prime(n)-1)/denominator(B(2*prime(n))) where prime(n)=n-th prime and B(k) denotes the k-th Bernoulli number.at n=5A090814
• a(n) = (3*9^n - 1)/2.at n=9A096053
• An inverse Catalan transform of A003462.at n=37A106233
• a(n) = 3*a(n-1) - a(n-3) + 3*a(n-4), with initial values 1,4,14,41.at n=18A132357
• a(n)=4a(n-1)-7a(n-2)+6a(n-3)-3a(n-4), n>4.at n=40A140343
• a(n) = (3^n-1)/2 if n odd, (3^n-1)/8 if n even.at n=19A152298
• a(n) = (3*3^n-(-1)^n)/2.at n=18A164907
• Least primitive number k such that 1/k is in the Cantor set and the fraction 1/k has period n in base 3.at n=18A175174
• The 3 X 3 X ... X 3 dots problem (3, n times): minimal number of straight lines (connected at their endpoints) required to pass through 3^n dots arranged in a 3 X 3 X ... X 3 grid.at n=19A261547
• a(n) = n*(n^6 + n^3 + 1)*(n^6 - n^3 + 1)*(n^2 + n + 1)*(n^2 - n + 1)*(n + 1) + 1.at n=3A269446
• Numbers k such that there is an anti-divisor d of k satisfying sigma(d) = k.at n=31A286917
• Least number m for which there exists some positive k < m where the sum of the integers from k + 1 to m inclusive is an n-th power > 1.at n=35A372782