25664

Appears in sequences

• Expansion of e.g.f. arcsinh(tanh(x) * exp(x)).at n=8A012661
• Least k such that the first k terms of A006928 contain n more 2's than 1's.at n=15A025507
• Triangle of Legendre-Stirling numbers of the second kind T(n,j), n >= 1, 1 <= j <= n, read by rows.at n=24A071951
• Diagonal T(n, 4) of triangle in A071951.at n=3A071952
• a(n) = 5*(n-1)*a(n-1) -2*(n-1)*a(n-2) with a(0)=0, a(1)=2.at n=5A108209
• Numbers k such that k divides 1 + Sum_{j=1..k} prime(j)^3 = 1 + A098999(k).at n=20A128167
• a(n) = 16*a(n-1) - 56*a(n-2) for n>1, with a(0)=1, a(1)=16.at n=4A154348
• a(n) = 25*n^2 + 2*n.at n=31A154377
• Triangle read by rows of Legendre-Stirling numbers of the second kind.at n=24A191935
• Number of (n+1)X8 0..1 arrays with the number of rightwards and downwards edge increases in each 2X2 subblock differing from the number in all its horizontal and vertical neighbors.at n=11A205071
• Number of 2 X 2 matrices having all terms in {1,...,n} and nonnegative determinant.at n=14A211058
• 4-level binary fanout graph coloring a rectangular array: number of n X 2 0..14 arrays where 0..14 label nodes of a graph with edges 0,1 1,3 3,5 3,6 1,4 4,7 4,8 0,2 2,9 9,11 9,12 2,10 10,13 10,14 and every array movement to a horizontal or vertical neighbor moves along an edge of this graph.at n=5A223443
• 4-level binary fanout graph coloring a rectangular array: number of nX6 0..14 arrays where 0..14 label nodes of a graph with edges 0,1 1,3 3,5 3,6 1,4 4,7 4,8 0,2 2,9 9,11 9,12 2,10 10,13 10,14 and every array movement to a horizontal or vertical neighbor moves along an edge of this graph.at n=1A223447
• T(n,k)=4-level binary fanout graph coloring a rectangular array: number of nXk 0..14 arrays where 0..14 label nodes of a graph with edges 0,1 1,3 3,5 3,6 1,4 4,7 4,8 0,2 2,9 9,11 9,12 2,10 10,13 10,14 and every array movement to a horizontal or vertical neighbor moves along an edge of this graph.at n=22A223449
• T(n,k)=4-level binary fanout graph coloring a rectangular array: number of nXk 0..14 arrays where 0..14 label nodes of a graph with edges 0,1 1,3 3,5 3,6 1,4 4,7 4,8 0,2 2,9 9,11 9,12 2,10 10,13 10,14 and every array movement to a horizontal or vertical neighbor moves along an edge of this graph.at n=26A223449
• Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 694", based on the 5-celled von Neumann neighborhood.at n=35A273411
• Indices in A006928 where the imbalance between 1's and 2's sets a new record.at n=28A274775
• Number of triangular regions in a "frame" of size n X n (see Comments in A331776 for definition), divided by 4.at n=22A332595
• Number of compositions (ordered partitions) of n into an even number of powers of 2.at n=20A339426
• a(n) = Sum_{k=0..floor(n/3)} 2^(n-2*k) * binomial(k,n-3*k)^2.at n=18A387485