35008

Appears in sequences

• a(n) = a(1)*a(n-1) + a(2)*a(n-2) + ... + a(n-1)*a(1) for n >= 3.at n=10A025227
• a(n) = (6^n - (-2)^n)/8.at n=7A053524
• a(n+1) = a(n)-th composite number, with a(1) = 11.at n=41A059407
• a(n) = 2*a(n-1) - 6*a(n-2), a(0)=0, a(1)=1.at n=13A088139
• (3*6^n + 2^n)/4.at n=6A090040
• Shifts left when Dirichlet convolution (DC:(b,b)->a) applied 3 times.at n=6A144317
• Square array A(n,k), n>=1, k>=1, read by antidiagonals, with A(1,k)=1 and sequence a_k of column k shifts left when Dirichlet convolution (DC:(b,b)->a) applied k times.at n=42A144324
• Triangle T(n,k) = coefficient of x^n in expansion of ((1 -sqrt(1 - 4*x - 4*x^2))/2)^k.at n=45A200756
• Triangle T(n,k) = coefficient of x^n in expansion of ((1 -sqrt(1 - 4*x - 4*x^2))/2)^k.at n=46A200756
• Number of -3..3 arrays x(i) of n+1 elements i=1..n+1 with set{t,u,v in 0,1}((x[i+t]+x[j+u]+x[k+v])*(-1)^(t+u+v)) having four distinct values for every i,j,k<=n.at n=13A211720
• Number of n X 2 0..3 arrays with no element equal to one plus the sum of elements to its left or one plus the sum of elements above it or zero plus the sum of the elements diagonally to its northwest or zero plus the sum of the elements antidiagonally to its northeast, modulo 4.at n=31A240789
• Number of n X 2 0..1 arrays with each 1 horizontally, vertically or antidiagonally adjacent to 2 or 3 neighboring 1s.at n=11A296399
• Numbers that are palindromes in both ternary and balanced ternary representations with representations that are different.at n=11A354886
• Square array T(n,k), n >= 0, k >= 0, read by antidiagonals downwards, where T(n,0) = 0^n and T(n,k) = k * Sum_{r=0..n} binomial(n,r) * binomial(2*r+k,n)/(2*r+k) for k > 0.at n=63A378317
• Square array T(n,k), n >= 0, k >= 0, read by antidiagonals downwards, where T(n,0) = 0^n and T(n,k) = k * Sum_{r=0..n} binomial(n,r) * binomial(2*r+k,n)/(2*r+k) for k > 0.at n=64A378317