19292

Appears in sequences

• Indices of prime Mersenne numbers (A001348).at n=30A016027
• a(n) = binomial(n+4,4)*(4*n+5)/5.at n=12A034263
• G.f.: 1/((1-x)*(1-x^2))^3.at n=24A038163
• Number of solutions to n^2 < x^2 + y^2 + z^2 < (n+1)^2; number of lattice points between spheres of radii n and n+1.at n=39A078184
• Triangle, read by rows, where the n-th diagonal equals the n-th row transformed by triangle A008459 (squared binomial coefficients).at n=72A097084
• a(n) = Sum_{k=0..n/2} k*binomial(n-2*k, 3*k+2).at n=19A137361
• Number of ways to place 2 nonattacking amazons (superqueens) on an n X n board.at n=14A172200
• Number of length n 1..(4+1) arrays with every leading partial sum divisible by 2, 3 or 5.at n=7A254823
• Expansion of Product_{k>=1} (1 + 2*x^k)^k.at n=14A261562
• Number of ternary maps f : S X S X S -> S on a set S of n elements which can be represented as a superposition of binary maps * : S X S -> S (Version 1).at n=2A283840
• Numbers n such that (6k-1) for k=n, n+1, n+2, n+3 are all primes with no primes of the form (6k+1) in between.at n=20A296011