27336

Appears in sequences

• Number of unsensed loopless planar maps with n edges.at n=9A006391
• a(n+1) = a(n) converted to base 6 from base 4 (written in base 10).at n=10A023374
• Number of ways to place a non-attacking white and black knight on n X n chessboard.at n=12A035289
• Numbers k such that k | sigma_11(k).at n=40A055715
• Values of m such that N=(am+1)(bm+1)(cm+1) is a 3-Carmichael number (A087788), where a,b,c = 1,2,25.at n=8A064249
• Triangle read by rows: T(n,k) is the number of noncrossing trees with n edges in which the maximal number of contiguous border edges starting from the root in both directions is equal to k.at n=48A102595
• a(n) = n*(n+2)*(2*n-1)/3. Also, row sums of triangle A131422.at n=33A131423
• Duplicate of A131423.at n=33A143371
• 12 times hexagonal numbers: 12*n*(2*n-1).at n=34A143698
• Triangle t(n,k) read by rows: generalized Padovan factorial ratios c(n)/(c(k)*c(n-k)) where c are partial products of a generalized Padovan sequence with multiplier m=5.at n=38A172355
• Triangle t(n,k) read by rows: generalized Padovan factorial ratios c(n)/(c(k)*c(n-k)) where c are partial products of a generalized Padovan sequence with multiplier m=5.at n=42A172355
• Number of (w,x,y,z) with all terms in {0,...,n} and at least one of these conditions holds: w<R, x<R, y<R, z>R, where R=max{w,x,y,z}-min{w,x,y,z}.at n=12A212752
• a(n) = k, index of A165959(k) at record values.at n=18A230146
• Number of partitions p of n such that median(p) < mean(p).at n=38A240217
• Least m>0 for which m + n^2 is a square and m + triangular(n) is a triangular number (A000217).at n=35A267140
• a(n) = 4*(n + 1)*(n + 2)*(4*n + 3)/3.at n=16A267522
• p-INVERT of the primes (A000040), where p(S) = 1 - S - S^2.at n=6A289847
• Growth series for group with presentation < S, T : S^2 = T^3 = (S*T)^8 = 1 >.at n=33A298810
• Regular triangle read by rows: T(n,k) is the number of multiset partitions of normal multisets of size n into k blocks, where a multiset is normal if it spans an initial interval of positive integers.at n=30A317532
• Triangle T(n,f): the number of bicolored connected cubic graphs on 2n vertices with f vertices of the first color.at n=42A321304