27213

Appears in sequences

• T(2,2n), where T(k,m) is the number of sequences a_1,...,a_m of integers 0,1,...,n with n=floor(m/k) such that the 'bumped' sequence b_1,...,b_m has exactly k of each of 0,...,n-1, where b_i=a_i + j (mod n+1) with minimal j>=0 such that b_0,...,b_i contain at most k elements equal to b_i.at n=4A006698
• Partial sum of pi(k) from k = 1 to 2^n.at n=8A072111
• Numbers n such that 2^n divided by the number of digits of 2^n is an integer.at n=48A158520
• Number of length n+5 0..4 arrays with every six consecutive terms having two times the sum of some two elements equal to the sum of the remaining four.at n=3A249081
• T(n,k) = Number of length n+5 0..k arrays with every six consecutive terms having two times the sum of some two elements equal to the sum of the remaining four.at n=24A249085
• Number of length 4+5 0..n arrays with every six consecutive terms having two times the sum of some two elements equal to the sum of the remaining four.at n=3A249089
• Square array T(n,m) read by antidiagonals, T(n,m) is the number of (m,n)-parking functions.at n=62A260419
• Numbers k such that k!4 + 2^7 is prime, where k!4 = k!!!! is the quadruple factorial number (A007662).at n=22A291348
• Number of partitions of n with up to three distinct kinds of 1.at n=38A320690