34111

Appears in sequences

• Numbers n such that n | 12^n + 11^n + 10^n + 9^n + 8^n + 7^n + 6^n + 5^n + 4^n + 3^n + 2^n.at n=18A057290
• Roman numerals written using 1 for I, 2 for V, 3 for X, 4 for L, 5 for C, 6 for D, 7 for M.at n=42A061493
• a(n) = n*(n+1)*(n^2 + 2)/6.at n=21A071239
• a(n) = (n-1)*(n-2)^3 - A003878(n-3), with a(1) = a(2) = 0 and a(3) = 2.at n=38A075681
• Expansion of e.g.f.: (1-exp(x/(x-1)))/(1-x).at n=8A087860
• Number of nondecreasing integer sequences of length 10 with sum zero and sum of absolute values 2n.at n=17A158144
• Number of -5..5 arrays of length n with the sum ahead of each element differing from the sum following that element by 5 or less.at n=4A221964
• T(n,k)=Number of -k..k arrays of length n with the sum ahead of each element differing from the sum following that element by k or less.at n=40A221967
• Number of -n..n arrays of length 5 with the sum ahead of each element differing from the sum following that element by n or less.at n=4A221968
• Steffensen's bracket function [n,n-3].at n=20A241170
• a(n) = n*(n+1)*(22*n-19)/6.at n=21A256716
• Expansion of Product_{k>=1} 1/(1-x^(k^2))^(k^2).at n=40A291655
• Composite numbers k coprime to 13 such that k divides A006190(k) - Kronecker(13,k).at n=32A327654
• a(n) is the number of ways to split [n] = {1,2,...,n} into two (possibly empty) complementary intervals {1,2,...,i} and {i+1,i+2,...,n} and then, if both intervals are nonempty, select 2 nonempty blocks/cells (i.e., subintervals) from each of them, or if one of the intervals is empty, select 2 nonempty blocks/cells from the nonempty interval.at n=21A353232
• The lexicographically earliest "Increasing Term Fractal Jump Sequence" that does not use the digit 0 in any terms.at n=21A359385
• Number of distinct ways of expressing n using only addition, multiplication (with all factors greater than 1), necessary parentheses, and the number 1.at n=44A373446