19624

Appears in sequences

• An upper bound on the biplanar crossing number of the complete graph on n nodes.at n=48A007333
• Multiplicity of trivial character in V_n, where V = Sum V_n is the graded module for the Monster simple group.at n=40A014810
• Thickened pyramidal numbers: a(n) = 2*(n+1)*n + Sum_{i=1..n} (4*i*(i-1) + 1).at n=24A050533
• Number of compositions of n such that every part occurs with the same multiplicity.at n=26A098504
• Integers that are Rhonda numbers to base 16.at n=4A100975
• Numbers formed by the fourth nesting of pi(10^n).at n=8A101226
• Indices of primes in sequence defined by A(0) = 63, A(n) = 10*A(n-1) - 17 for n > 0.at n=14A101519
• Riordan array (1/sqrt(1-2*x-3*x^2), 1/sqrt(1-2*x-3*x^2) -1).at n=48A116392
• Triangle of Gely numbers, read by rows.at n=48A132795
• Expansion of 2*x*(1+x)*(1-2*x)/((1-x)^2*(1-2*x-x^2)).at n=11A133953
• Row sums of triangle A187120.at n=5A187123
• Sophie Germain 5-almost primes.at n=40A211162
• Number of nX2 0..3 arrays with rows and columns in lexicographic nondecreasing order but with exactly one mistake.at n=3A278430
• Number of nX4 0..3 arrays with rows and columns in lexicographic nondecreasing order but with exactly one mistake.at n=1A278432
• T(n,k)=Number of nXk 0..3 arrays with rows and columns in lexicographic nondecreasing order but with exactly one mistake.at n=11A278435
• T(n,k)=Number of nXk 0..3 arrays with rows and columns in lexicographic nondecreasing order but with exactly one mistake.at n=13A278435
• Numbers k such that k!6 - 27 is prime, where k!6 is the sextuple factorial number (A085158).at n=27A289698
• Numbers k such that Bernoulli number B_{k} has denominator 61410.at n=6A295591
• Numbers whose sum of prime factors is equal to their product of prime indices.at n=38A331384
• Triangle read by rows: row n gives coefficients T(n,k), in descending powers of m, of a polynomial Q_n(m) (of degree n - 1) in an expression for the number of subdivisions A(m,n) of a grid with two rows.at n=25A336244