29523

Appears in sequences

• a(n) = (3^n - 3)/2.at n=9A029858
• Numbers having four 4's in base 9.at n=19A043472
• a(n) = 3*(a(n-2) + 1), with a(0) = 1, a(1) = 3.at n=17A087503
• Expansion of (1+3x)/((1-x^2)(1-3x^2)).at n=17A094025
• a(0) = 1, a(1) = 3, a(n) = 3*a(n-1) + 3 for n > 1.at n=9A123109
• Triangle read by rows where the n-th row is the first row of M^n, with M the (n+1)-by-(n+1) matrix with (1,3,1,3,1,3,...) on its main diagonal and (3,1,3,1,3,1,...) on its superdiagonal.at n=46A124572
• a(0) = 0, a(1) = 1; for n > 1, a(n) = a(n-2) + a(n-1) + A000071(n+1).at n=17A140992
• Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, 0), (-1, 0, 0), (0, -1, 1), (0, 1, -1), (1, 1, 0)}.at n=9A149194
• a(n+1) = a(n) + floor(a(n)/5) with a(0)=5.at n=50A182306
• Numbers n such that the trinomial x^n-x-1 is irreducible over GF(3).at n=35A223938
• a(n) = Sum_{k=1..9} n^k.at n=3A228293
• Natural numbers k such that k is a multiple of its number of "feasible" partitions.at n=62A254438
• Rectangular array read by rows: T(n,k) is the number of words of length n on alphabet {0,1,2} that have exactly k records, n>=0, 0<=k<=3.at n=42A285852
• Number of nX7 0..1 arrays with every element equal to 1, 2, 4 or 6 king-move adjacent elements, with upper left element zero.at n=10A298054
• Number of primes <= A324154(n).at n=2A324164
• a(n) is the numerator of the ratio of winning probabilities in a game similar to A370823, but with a draw and single round odds A:B:draw of 3:2:1.at n=8A370825
• Sorted positions of first appearances in the run-compression (A037201) of the first differences (A001223) of the prime numbers (A000040).at n=41A376521