88572

Appears in sequences

• a(n) = (3^n - 3)/2.at n=10A029858
• a(n) = 3*(a(n-2) + 1), with a(0) = 1, a(1) = 3.at n=19A087503
• Expansion of (1+3x)/((1-x^2)(1-3x^2)).at n=19A094025
• a(n) = 6 * A015518(n).at n=10A120471
• a(n) = (prime(n)^6 - prime(n)^2)/20.at n=4A122220
• a(0) = 1, a(1) = 3, a(n) = 3*a(n-1) + 3 for n > 1.at n=10A123109
• a(n) = H(2*n)*(2*n)!/n! where H(n) = Sum_{k=1..n} 1/k, the n-th harmonic number.at n=5A123989
• a(n) = H(n)*n!/(floor(n/2))!, where H(n) = Sum_{k=1..n} 1/k, the n-th harmonic number.at n=10A124078
• Number of 0..n arrays x(0..3) of 4 elements without any interior element greater than both neighbors.at n=20A200887
• n such that A205592(n) > n.at n=35A205594
• a(n) = Sum_{k=1..10} n^k.at n=3A228294
• Number of (n+1)X(1+1) 0..7 arrays with every 2X2 subblock having the sum of the absolute values of all six edge and diagonal differences equal to 16.at n=3A233934
• Number of (n+1)X(4+1) 0..7 arrays with every 2X2 subblock having the sum of the absolute values of all six edge and diagonal differences equal to 16.at n=0A233937
• T(n,k)=Number of (n+1)X(k+1) 0..7 arrays with every 2X2 subblock having the sum of the absolute values of all six edge and diagonal differences equal to 16 (16 maximizes T(1,1)).at n=6A233939
• T(n,k)=Number of (n+1)X(k+1) 0..7 arrays with every 2X2 subblock having the sum of the absolute values of all six edge and diagonal differences equal to 16 (16 maximizes T(1,1)).at n=9A233939
• 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=46A285852
• The number of primes <= A324155(n).at n=2A324165