25832

Appears in sequences

• Maximum cycle size in range [A014137(n-1)..A014138(n-1)] of permutation A125985/A125986.at n=11A126292
• Number of permutations of floor(i*8/5), i=0..n-1, with all sums of 3 adjacent terms unique.at n=7A152326
• Triangle of coefficients of polynomials v(n,x) jointly generated with A210603; see the Formula section.at n=50A210738
• Number of (n+2)X(1+2) 0..1 arrays with the (lower) medians of each row equal and of each column equal.at n=4A237740
• Number of (n+2)X(5+2) 0..1 arrays with the (lower) medians of each row equal and of each column equal.at n=0A237744
• T(n,k)=Number of (n+2)X(k+2) 0..1 arrays with the (lower) medians of each row equal and of each column equal.at n=10A237745
• T(n,k)=Number of (n+2)X(k+2) 0..1 arrays with the (lower) medians of each row equal and of each column equal.at n=14A237745
• Number of times an evil number is encountered when iterating from 2^(n+1)-2 to (2^n)-2 with the map x -> x - (number of runs in binary representation of x).at n=19A255063
• Number of 2 X n integer arrays with each element equal to the number of horizontal and antidiagonal neighbors not equal to itself.at n=22A265992
• Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 557", based on the 5-celled von Neumann neighborhood.at n=28A272926
• G.f.: Product_{n=-oo..+oo} (1 + x^n*(1 + x^n)^n).at n=27A293603
• For 1<=x<=n, 1<=y<=n with gcd(x,y)=1, write 1 = gcd(x,y) = u*x+v*y with u,v minimal; a(n) = m^2*s, where s is the population variance of the values of v and m is the number of such values.at n=10A345693