336336

Appears in sequences

• a(n) = (1/(9n-3))*M(3n; n,n,n), where M() is a multinomial coefficient.at n=5A024489
• a(n) = (n/(n+1)) * lcm(1,2,...,n+1).at n=13A025558
• a(n) = 28*(n+1)*binomial(n+3,8)/3.at n=6A027793
• a(n) = 42*binomial(n,10).at n=16A088626
• Triangle interpolating between (-1)^n (A033999) and the swinging factorial function (A056040) restricted to odd indices (2n+1)$ (A002457), read by rows.at n=42A163945
• Number of circular permutations of length n without consecutive triples i,i+2,i+4.at n=10A174074
• Number of permutations of 0..floor((n*3-2)/2) on odd squares of an n X 3 array such that each row and column of odd squares is increasing.at n=10A215294
• Triangle read by rows: number of circular permutations of [1..n] with k progressions of rise 1, distance 2 and length 3 (n >= 3, k >= 0).at n=22A216719
• Duplicate of A174074.at n=7A216720
• a(n) = (3^n-1)*(3^n-3)*(3^n+3)*(3^n-4)/5!.at n=4A275637
• Triangle read by rows: T(n,k) = binomial(2*n,2*k)*binomial(2*n-2*k,n-k)/(n+1-k) for 0<=k<=n.at n=39A280580
• Maximum number of copies of a 123456 permutation pattern in an alternating (or zig-zag) permutation of length n + 9.at n=20A339356
• Positions of records in A227872, i.e., integers whose number of odious divisors sets a new record.at n=30A355969
• a(n) is the smallest number that has exactly n divisors that are cyclops numbers (A134808).at n=13A357033
• Expansion of g.f. A(x,y) satisfying A(x,y) = 1 + x*A(x,y)/(1 - x*y * A(x,y))^2, as a triangle of coefficients T(n,k) of x^n*y^k in A(x,y), read by rows n >= 0.at n=71A365770