19173

Appears in sequences

• a(n) = floor(n*(n+2)*(2*n-1)/8).at n=41A007518
• Expansion of 1/((1-2x)(1-3x)(1-5x)(1-8x)).at n=4A025932
• Number of partitions of n that do not contain 7 as a part.at n=38A027341
• Number of partitions of n such that if k is the largest part, then k-2 occurs as a part.at n=45A119907
• a(n) is the smallest number which has in its English name the letter "n" in the n-th position beginning the count from the end.at n=37A173204
• 1/4 the number of (n+1) X 2 0..3 arrays with every 2 X 2 subblock having exactly two distinct clockwise edge differences.at n=7A209546
• T(n,k)=1/4 the number of (n+1)X(k+1) 0..3 arrays with every 2X2 subblock having exactly two distinct clockwise edge differences.at n=28A209553
• T(n,k)=1/4 the number of (n+1)X(k+1) 0..3 arrays with every 2X2 subblock having exactly two distinct clockwise edge differences.at n=35A209553
• Partitions with subdiagonal growth: number of partitions (p0, p1, p2, ...) of n with pi - p0 <= i.at n=40A238876
• Number of length-n gap-free words on {1,2,3}.at n=9A240506
• Number of active (ON, black) cells at stage 2^n-1 of the two-dimensional cellular automaton defined by "Rule 622", based on the 5-celled von Neumann neighborhood.at n=7A269566
• Numerators of partial sums of the series 1 + 2*Sum_{k >= 1} 1/(4*k^4 + 1).at n=4A292227
• Number of compositions of n with weakly increasing first quotients.at n=44A342492
• Numbers which are the product of two S-primes (A057948) in exactly three ways.at n=15A343828
• Odd numbers m for which A379113(m^2) > 1, i.e., k = m^2 has a proper unitary divisor d > 1 such that A048720(A065621(sigma(d)),sigma(k/d)) is equal to sigma(k).at n=38A379122