30656

Appears in sequences

• Number of down-up permutations of n+5 starting with 5.at n=6A006217
• Triangle of Euler-Bernoulli or Entringer numbers read by rows: T(n,k) is the number of down-up permutations of n+1 starting with k+1.at n=48A008282
• Read across rows of Euler-Bernoulli or Entringer triangle.at n=31A008283
• Triangle of Euler-Bernoulli or Entringer numbers.at n=51A010094
• a(n) = s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n-k+1), where k = [ n/2 ], s = (F(2), F(3), F(4), ...), t = (primes).at n=23A025111
• Triangle in which rows are permutations of the rows of A008282.at n=52A064192
• Reflection of triangle in A008280 in vertical axis.at n=59A108040
• Number of (n+1) X (1+1) 0..2 arrays with the upper median of every 2 X 2 subblock differing from its horizontal and vertical neighbors by exactly one.at n=6A237630
• Number of (n+1)X(7+1) 0..2 arrays with the upper median of every 2X2 subblock differing from its horizontal and vertical neighbors by exactly one.at n=0A237636
• T(n,k) = Number of (n+1) X (k+1) 0..2 arrays with the upper median of every 2 X 2 subblock differing from its horizontal and vertical neighbors by exactly one.at n=21A237637
• T(n,k) = Number of (n+1) X (k+1) 0..2 arrays with the upper median of every 2 X 2 subblock differing from its horizontal and vertical neighbors by exactly one.at n=27A237637
• E.g.f. A(x) satisfies A'(x) = 1 - log(1-x) * A(2*x).at n=7A355230
• Numbers k such that x=(sigma(k) XOR 2*k) divides k in carryless binary arithmetic, when the binary expansions of k and x are interpreted as polynomials in ring GF(2)[X].at n=54A379236