51790

Appears in sequences

• Number of partitions of {1..2n} that are invariant under a permutation consisting of n 2-cycles.at n=7A002872
• Number of fixed points of permutation of SetPartitions under {1,2,...,n}->{n,n-1,...,1}. Number of symmetric arrangements of non-attacking rooks on upper half of n X n chessboard.at n=14A080107
• Table by antidiagonals, T(n,k) is the number of partitions of {1..(nk)} that are invariant under a permutation consisting of n k-cycles.at n=43A162663
• a(n) is the number of digits in the decimal representation of the smallest power of 7 that contains n consecutive identical digits.at n=9A217189
• Number of nX3 0..1 arrays with every element equal to 1, 2, 3, 5, 6 or 8 king-move adjacent elements, with upper left element zero.at n=7A299460
• T(n,k)=Number of nXk 0..1 arrays with every element equal to 1, 2, 3, 5, 6 or 8 king-move adjacent elements, with upper left element zero.at n=47A299465
• T(n,k)=Number of nXk 0..1 arrays with every element equal to 1, 2, 3, 5, 6 or 8 king-move adjacent elements, with upper left element zero.at n=52A299465
• T(n,k)=Number of nXk 0..1 arrays with every element equal to 1, 2, 3, 5, 6, 7 or 8 king-move adjacent elements, with upper left element zero.at n=47A300108
• T(n,k)=Number of nXk 0..1 arrays with every element equal to 1, 2, 3, 5, 6, 7 or 8 king-move adjacent elements, with upper left element zero.at n=52A300108
• Number A(n,k) of length-n restricted growth strings (RGS) with growth <= k and first element in [k]; square array A(n,k), n>=0, k>=0, read by antidiagonals.at n=52A306024
• a(n) = A324542(2*prime(n)).at n=14A324552
• a(n) = Sum_{d|n} d^phi(n/d).at n=41A344484
• Divide the positive integers into subsets of lengths given by successive primes. a(n) is the sum of primes contained in the n-th subset.at n=35A344718