34251

Appears in sequences

• Number of two-rowed partitions of length 6.at n=28A070559
• a(1) = 3; a(n) = smallest number such that the forward as well as the reverse n-th partial concatenation is a prime for n>1. (Reverse concatenation is taken term-wise and not digit-wise).at n=25A083993
• Sum of entries in all the arrangements of the set {1,2,...,n} (to n=0 there corresponds the empty set).at n=6A134432
• An INVERT transform of the Thue-Morse sequence.at n=19A144026
• Number of pairs of rabbits in month n in the dying rabbits problem, if they become mature after 4 months and give birth to exactly 7 pairs, one per month.at n=36A160333
• a(n) is the string of integers S(n) concatenated together with no commas, where S(1)=1; for even n, S(n) = S(n-1),n; and for odd n>1, S(n) is obtained by adding 1 to every entry of S(n-1) and appending 1.at n=4A171093
• The growth series for the affine Coxeter (or Weyl) group [3,3,5] (or H_4).at n=44A266783
• Triangle read by rows, T(n,k) = Sum_{j=0..n} C(n,j)*L(j,k), L the unsigned Lah numbers A271703, for n>=0 and 0<=k<=n.at n=30A271705
• Derangements of {1,2,...,n} (n >= 2) in lexicographic order.at n=27A320588
• a(n) = (1/n) * Sum_{k=1..n} k * lcm(k,n).at n=48A344509