22482

Appears in sequences

• Number of block permutations on an n-set which are uniform, i.e., corresponding blocks have same size.at n=6A023998
• Number of partitions satisfying cn(2,5) + cn(3,5) <= cn(0,5) + cn(1,5) + cn(4,5).at n=38A039867
• Becomes prime or 4 after exactly 9 iterations of f(x) = sum of prime factors of x.at n=15A048131
• Duplicate of A023998.at n=6A051921
• Largest eigenvalue, rounded to the nearest integer, of a rank n matrix of 1..n^2 filled successively along antidiagonals (A069480).at n=33A072332
• Numbers k such that phi(k-6) = phi(k) = phi(k+6).at n=26A217006
• Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 158", based on the 5-celled von Neumann neighborhood.at n=39A270335
• Number A(n,k) of set partitions of [k*n] such that within each block the numbers of elements from all residue classes modulo k are equal for k>0, A(n,0)=1; square array A(n,k), n>=0, k>=0, read by antidiagonals.at n=42A275043
• G.f.: A(x) = Sum_{n>=1} Product_{k=0..n-1} (x + k*A(x)).at n=6A276367
• Number T(n,k) of colored set partitions of [n] where colors of the elements of subsets are in (weakly) increasing order and exactly k colors are used; triangle T(n,k), n>=0, 0<=k<=n, read by rows.at n=27A321296
• Number T(n,k) of colored set partitions of [n] where colors of the elements of subsets are distinct and in increasing order and exactly k colors are used; triangle T(n,k), n>=0, 0<=k<=n, read by rows.at n=27A322670
• Number of rooted self-avoiding king's walks of n moves on an infinite chessboard with first move specified.at n=5A323561
• Triangle read by rows: T(n,k) is the number of 2-balanced partitions of a set of n elements in which the first and the second subsets have cardinality k, for n >= 0, k = 0..floor(n/2).at n=48A343254