34385

Appears in sequences

• a(n) = [ a(n-1)/a(1) ] + [ a(n-3)/a(3) ] + [ a(n-5)/a(5) ] + ..., for n >= 3.at n=27A022860
• Numbers k such that k divides the (left) concatenation of all numbers <= k written in base 11 (most significant digit on right and removing all least significant zeros before concatenation).at n=8A029528
• a(n) = (2*n-1)*(n^2 -n +2)/2.at n=32A063488
• Triangle read by rows: colored polyominoes. For n >= 1, 1 <= k <= n, T(n, k) is the number of k-colored n-celled polyominoes, counted up to rotation, reflection and permutation of the colors. Adjacent cells must be different colors. T(n, k) counts only polyominoes that include all k colors.at n=43A088972
• Cancellation factor in reducing Sum_{k=0...n} 1/k! to lowest terms.at n=64A093101
• Records in A093101.at n=5A093647
• a(n) = 65*n^2.at n=22A165798
• 4*(n + 7)^3 - 27*(n + 7)^2 = (4*n +1)*(n+7)^2.at n=16A245033
• a(n) = 4*prime(n)^3 - 27*prime(n)^2 = (prime(n)^2)*[4*prime(n) - 27], n >= 4.at n=5A245036
• G.f. A(x) satisfies: A(x) = Sum_{n>=0} x^n / (1 - x^(n+1)*A(x)^2).at n=7A340356
• Triangle read by rows. Number T(n, k) of partitions of the multiset [1, 1, 1, 1, 2, 2, 2, 2, ..., n, n, n, n] into k nonempty subsets, for 4 <= k <= 4n.at n=37A360038