25306

Appears in sequences

• a(n) = 4*a(n-1) - 4*a(n-2) + 3*a(n-3).at n=10A099215
• Triangle read by rows T(n,k) = the number of Dyck paths of semilength n with k UUDDU's, 0<=k<=[(n-1)/2].at n=46A114848
• Number of arrangements of n+1 nonzero numbers x(i) in -4..4 with the sum of div(x(i),x(i+1)), where div(a,b)=a/b produces the integer quotient implying a nonnegative remainder, equal to zero.at n=4A190066
• T(n,k)=Number of arrangements of n+1 nonzero numbers x(i) in -k..k with the sum of div(x(i),x(i+1)), where div(a,b)=a/b produces the integer quotient implying a nonnegative remainder, equal to zero.at n=32A190071
• Number of arrangements of 6 nonzero numbers x(i) in -n..n with the sum of div(x(i),x(i+1)), where div(a,b)=a/b produces the integer quotient implying a nonnegative remainder, equal to zero.at n=3A190075
• Number of -1..1 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 two, three, four or five distinct values for every i,j,k<=n.at n=11A211527
• a(n) = A278589(n)/2^n.at n=5A278590
• Number of non-loop-graphical integer partitions of 2n.at n=21A339655
• Triangular array T(n,k), read by rows: coefficients of strong divisibility sequence of polynomials p(1,x) = 1, p(2,x) = 1 + 4*x, p(n,x) = u*p(n-1,x) + v*p(n-2,x) for n >= 3, where u = p(2,x), v = 1 - x - x^2.at n=48A367209
• Number of isomorphism classes of multigraphs representing particle interactions in phi-4-theory on n non-external vertices.at n=8A387168