18636

Appears in sequences

• Number of 6 X 6 binary matrices with n ones, with no zero rows or columns, up to row and column permutation.at n=10A056037
• Coefficients in the series (1 + x^2 + x^3 + x^5 + x^7 + x^11 + x^13 + ... )/(1 - x - x^4 - x^6 - x^8 - x^9 - x^10 - x^12 - x^14 - ... ).at n=24A058355
• Values of m such that N=(am+1)(bm+1)(cm+1) is a 3-Carmichael number (A087788), where a,b,c = 1,2,15.at n=36A064244
• 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=5A064249
• Values of n such that N=(an+1)(bn+1)(cn+1) is a 3-Carmichael number (A087788), where a,b,c = 1,2,35.at n=9A064254
• a(n) = floor(11^n/9^n).at n=49A094997
• Triangle read by rows: T(n,k) is number of paths from (0,0) to (3n,0) that stay in the first quadrant (but may touch the horizontal axis), consisting of steps u=(2,1), U=(1,2), or d=(1,-1) and having height of the first peak equal to k.at n=47A108437
• Convolution triangle, read by rows, where diagonals are successive self-convolutions of A118351.at n=50A118354
• G.f.: exp( Sum_{n>=1} A051064(n)*3^A051064(n)*x^n/n ) where A051064(n) equals the 3-adic valuation of 3n.at n=20A183038
• The number of different classes of 2-dimensional convex lattice polytopes having volume n/2 up to unimodular equivalence.at n=41A187015
• Triangle T(n,k) of the numbers of nodes in all non-extendable (complete) non-self-adjacent simple paths within a square lattice bounded by rectangles with nodal dimensions n and k, n >= k >= 2.at n=8A214397
• a(n) is a refactorable number and the sum of all refactorable numbers <= a(n) is also a refactorable number.at n=38A235177
• Number of length n+5 0..5 arrays with some disjoint triples in each consecutive six terms having the same sum.at n=0A248065
• T(n,k)=Number of length n+5 0..k arrays with some disjoint triples in each consecutive six terms having the same sum.at n=10A248068
• Number of length 1+5 0..n arrays with some disjoint triples in each consecutive six terms having the same sum.at n=4A248069
• Number T(m,n) of series-reduced free trees with n nodes of which exactly m >= 3 are leaves, m+1 <= n <= 2m-2.at n=99A271205
• Number of integer partitions of n whose multiplicities appear with distinct multiplicities.at n=42A325329
• Sum of the corners of a 2n+1 X 2n+1 square spiral.at n=33A325958