23307

Appears in sequences

• Sum along upward diagonal of Pascal triangle up to (but not including) halfway point.at n=25A010755
• T(n,n-5), array T as in A038792.at n=20A038795
• Numerators of continued fraction convergents to sqrt(984).at n=7A042904
• a(n) = A077731(n)^(1/2).at n=4A077732
• Numbers k for which 5*k-4, 5*k-2, 5*k+2, and 5*k+4 are primes.at n=39A178082
• Number of n X 7 0..2 arrays x(i,j) with each element horizontally or antidiagonally next to at least one element with value 2-x(i,j).at n=1A230183
• T(n,k)=Number of nXk 0..2 arrays x(i,j) with each element horizontally or antidiagonally next to at least one element with value 2-x(i,j).at n=29A230184
• Number of 2 X n 0..2 arrays x(i,j) with each element horizontally or antidiagonally next to at least one element with value 2-x(i,j).at n=6A230185
• Number of partitions of n having standard deviation σ > 3.at n=40A238655
• Number of partitions of n such that (least part) < (multiplicity of greatest part).at n=49A240178
• Numbers n such that 5*6^n + 1 is prime.at n=19A247260
• Total volume of all rectangular prisms with dimensions p, q and (p + q)/2 such that p and q are squarefree, n = p + q and p <= q.at n=33A303222
• a(n) is the minimum positive integer k such that the concatenation of k, a(n-1), a(n-2), ..., a(2), and a(1) is the lesser of a pair of twin primes (i.e., a term of A001359), with a(1) = 11.at n=37A350246
• Draw a regular n-gon and the enclosing circle, then for each pair of vertices X, Y, draw a circle with diameter XY; the union of these figures is the graph H_n; sequence gives number of edges in H_n.at n=16A370979
• a(n) = Sum_{k=0..n} binomial(4*n+k,n-k).at n=5A389361