50310

Appears in sequences

• Numbers n such that n and n+1 are differences between 2 positive cubes in at least one way.at n=27A038594
• Values of m such that N=(am+1)(bm+1)(cm+1) is a 3-Carmichael number (A087788), where a,b,c = 1,2,17.at n=17A064245
• Let p = n-th irregular prime, A000928(n). Then a(n) = smallest value of m such that numerator(Bernoulli(2*m)/(2*m)) / numerator(Bernoulli(2*m)/(2*m*(2*m-1))) equals p.at n=22A092291
• Number of ordered octuples of distinct pairwise coprime positive integers with largest element n.at n=24A186979
• Number of 7-element subsets of {1, 2, ..., n} having pairwise coprime elements.at n=27A186983
• a(n) = sum(stirling2(n,k)*stirling2(n+1,k+1),k=0..n).at n=6A192546
• Number of (n+2)X4 binary arrays avoiding patterns 000 and 001 in rows, columns and nw-to-se diagonals.at n=3A202429
• Number of (n+2)X6 binary arrays avoiding patterns 000 and 001 in rows, columns and nw-to-se diagonals.at n=1A202431
• T(n,k)=Number of (n+2)X(k+2) binary arrays avoiding patterns 000 and 001 in rows, columns and nw-to-se diagonals.at n=11A202435
• T(n,k)=Number of (n+2)X(k+2) binary arrays avoiding patterns 000 and 001 in rows, columns and nw-to-se diagonals.at n=13A202435
• Triangle T(n,k) read by rows: coefficients of polynomials P_n(t) defined in Formula section.at n=18A278458
• Number of n X n 0..1 arrays with every element equal to 0 or 1 horizontally or antidiagonally adjacent elements, with upper left element zero.at n=11A301785
• a(n) = Sum_{k=0..floor(n/5)} (-1)^k * (n-4*k)!/(n-5*k)!.at n=35A358606