15690529804
domain: N
Appears in sequences
- a(n) = (3^n - 1)/2.at n=22A003462
- Number of primitive (aperiodic) word structures of length n using a 3-ary alphabet.at n=22A056274
- a(n) = (-1)^n * (3^n - 1)/2.at n=22A076040
- a(n) = 3*a(n-1) - a(n-3) + 3*a(n-4), with initial values 2,5,13,40.at n=21A133448
- a(n) = 3*a(n-1) - a(n-3) + 3*a(n-4), with initial values 2,4,13,40.at n=21A133453
- a(0) = 1 and a(n) = (3^n - (-1)^n)/2 for n >= 1.at n=22A152011
- a(n) = (9^n - 1)/2.at n=11A191681
- 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=22A261547