18464

Appears in sequences

• Expansion of g.f. (1 + x - 2*x^2 - x^3)/(1/2 - 2*x^2 + x^4).at n=16A030435
• a(n) = (2 + sqrt(2))^n + (2 - sqrt(2))^n.at n=8A056236
• Number of meaningful differential operations of the k-th order on the space R^12.at n=12A129639
• Number of walks within N^2 (the first quadrant of Z^2) starting and ending at (0,0) and consisting of n steps taken from {(-1, -1), (-1, 1), (0, 1), (1, -1), (1, 0)}.at n=11A151340
• a(0) = 4; for n>0, a(n) = a(n-1)^2 - 2^(1+2^(n-1)).at n=3A152121
• Number of -n..n arrays x(0..3) of 4 elements with zero sum and elements alternately strictly increasing and strictly decreasing.at n=19A200058
• Number of (n+1) X 2 0..2 arrays with every 2 X 2 subblock having two distinct values, and new values 0..2 introduced in row major order.at n=5A209890
• Number of (n+1)X7 0..2 arrays with every 2X2 subblock having two distinct values, and new values 0..2 introduced in row major order.at n=0A209895
• T(n,k)=Number of (n+1)X(k+1) 0..2 arrays with every 2X2 subblock having two distinct values, and new values 0..2 introduced in row major order.at n=15A209897
• T(n,k)=Number of (n+1)X(k+1) 0..2 arrays with every 2X2 subblock having two distinct values, and new values 0..2 introduced in row major order.at n=20A209897
• 3-level binary fanout graph coloring a rectangular array: number of nX7 0..6 arrays where 0..6 label nodes of a graph with edges 0,1 1,3 1,4 0,2 2,5 2,6 and every array movement to a horizontal or vertical neighbor moves along an edge of this graph.at n=1A223422
• T(n,k)=3-level binary fanout graph coloring a rectangular array: number of nXk 0..6 arrays where 0..6 label nodes of a graph with edges 0,1 1,3 1,4 0,2 2,5 2,6 and every array movement to a horizontal or vertical neighbor moves along an edge of this graph.at n=29A223423
• T(n,k)=3-level binary fanout graph coloring a rectangular array: number of nXk 0..6 arrays where 0..6 label nodes of a graph with edges 0,1 1,3 1,4 0,2 2,5 2,6 and every array movement to a horizontal or vertical neighbor moves along an edge of this graph.at n=34A223423
• Number of partitions p of n such that the number of distinct parts is not a part and max(p) - min(p) is a part.at n=50A241388
• Number of partitions p of n such that (number of numbers of the form 5k + 1 in p) is a part of p.at n=38A241550
• Number of (n+2)X(3+2) 0..3 arrays with every 3X3 subblock row and column sum not 2 4 5 or 7 and every diagonal and antidiagonal sum 2 4 5 or 7.at n=4A251871
• Number of (n+2)X(5+2) 0..3 arrays with every 3X3 subblock row and column sum not 2 4 5 or 7 and every diagonal and antidiagonal sum 2 4 5 or 7.at n=2A251873
• T(n,k)=Number of (n+2)X(k+2) 0..3 arrays with every 3X3 subblock row and column sum not 2 4 5 or 7 and every diagonal and antidiagonal sum 2 4 5 or 7.at n=23A251876
• T(n,k)=Number of (n+2)X(k+2) 0..3 arrays with every 3X3 subblock row and column sum not 2 4 5 or 7 and every diagonal and antidiagonal sum 2 4 5 or 7.at n=25A251876
• Euler transform of Lucas numbers.at n=13A261031