19176

Appears in sequences

• 4-dimensional figurate numbers: a(n) = (6*n-2)*binomial(n+2,3)/4.at n=15A002419
• a(n) = T(n,n-3), where T is the array in A026374.at n=31A026382
• a(1)=1, a(n) is the smallest integer > a(n-1) such that the sum of elements of the simple continued fraction for S(n)=1/a(1)+1/a(2)+...+1/a(n) equals n*(n+1)/2 the n-th triangular number.at n=24A071184
• a(n) = (5*n+1)*(5*n+6).at n=27A085025
• Number of binary strings of length n with no substrings equal to 0000 or 0111.at n=17A164391
• Number of 3-step one or two space at a time bishop's tours on an n X n board summed over all starting positions.at n=20A187047
• Number of length n left factors of Dyck paths having no triple-rises (triple-rise = three consecutive (1,1)-steps).at n=22A191786
• Product of Pell and Lucas numbers.at n=8A226638
• a(n) = (Sum_{k=0..n-1} A246065(k)) / n^2.at n=9A246138
• 30-gonal pyramidal numbers: a(n) = n*(n+1)*(28*n-25)/6.at n=16A256650
• Least positive integer m with prime(m)+2 and prime(prime(m))+2 both prime such that prime(m*n)+2 and prime(prime(m*n))+2 are both prime.at n=40A259487
• Numbers n such that A002088(n) < 3n^2/Pi^2.at n=34A285022
• Expansion of x*(1 + 4*x + x^2)/((1 - x)^5*(1 + x)^4).at n=31A290055
• Number of closed meanders with 2n crossings and 5 digons.at n=13A300901
• Number of n X 5 0..1 arrays with every element unequal to 0, 1, 2, 5, 6 or 7 king-move adjacent elements, with upper left element zero.at n=6A306163
• Number of nX7 0..1 arrays with every element unequal to 0, 1, 2, 5, 6 or 7 king-move adjacent elements, with upper left element zero.at n=4A306165
• T(n,k)=Number of nXk 0..1 arrays with every element unequal to 0, 1, 2, 5, 6 or 7 king-move adjacent elements, with upper left element zero.at n=59A306166
• Triangle T(n,m) = (2*m*n+2*n-2*m^2+1)*C(2*n+2,2*m+1)/(4*n+2).at n=47A338523
• Triangle T(n,m) = (2*m*n+2*n-2*m^2+1)*C(2*n+2,2*m+1)/(4*n+2).at n=52A338523
• Number of integer partitions of n with non-integer median of multiplicities.at n=45A360690