4782968

Appears in sequences

• a(n) = 3^n - 1.at n=14A024023
• a(n) = 9^n-1.at n=7A024101
• a(n+1) = smallest number not containing any digits of a(n), working in base 3.at n=28A030439
• Numbers that are repdigits in base 3.at n=28A048328
• Numbers of the form 3^m - 1 or 2*3^m - 1; i.e., the union of sequences A048473 and A024023.at n=28A062318
• Maximal cycle lengths in a certain class of one-dimensional cellular automata.at n=26A085589
• Maximal cycle lengths in a certain class of one-dimensional cellular automata.at n=26A085590
• Triangle read by rows: T(n,k) = (n+1,k)-th element of (M^9-M)/8, where M is the infinite lower Pascal's triangle matrix, 1<=k<=n.at n=29A096043
• a(n) = 0^n + 3^n - 1.at n=14A103453
• a(n) = 3^n - (-1)^n.at n=14A105723
• a(n) = 2*A132357(n).at n=13A135263
• Clique number of commuting graph of symmetric group S_n.at n=42A135908
• Clique number of commuting graph of alternating group A_n.at n=42A135909
• a(n) = A000244(n) - A010684(n).at n=14A141317
• a(n) is the smallest integer not yet in the sequence with no common base-3 digit with a(n-1).at n=35A158928
• 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=40A167051
• a(n) = n^7 - 1.at n=8A258808
• a(n) is the smallest number k > 1 such that k^n - 1 is divisible by 3^n.at n=13A316505
• Modulo 3 Pisano period of 'n-bonacci' series.at n=13A337212
• Numbers m such that tau(m) = tau(m + 1) + 1 = tau(m + 2), where tau(k) = the number of divisors of k (A000005).at n=7A339777