346528

Appears in sequences

• Triangular numbers which are 9-almost primes.at n=8A076583
• Triangle read by rows: T(n,k) = (2 * (binomial(n,k)) * (n + 2 * k + 3)!)/((k + 1)! * (k + 2)! * (n + 3)!).at n=39A087727
• Triangular numbers that are the product of three distinct triangular numbers greater than 1.at n=32A225440
• Triangular numbers divisible by the square of the sum of their digits.at n=16A243008
• Triangle T read by rows: T(n,k) = binomial(2*n+1,k)*binomial(n,k), n>=0, 0<=k<=n.at n=41A252501
• Triangle T read by rows: T(n,k) = binomial(2*n+1,k)*binomial(n,k), n>=0, 0<=k<=n.at n=42A252501
• Number of nX7 0..2 arrays with no element equal to any value at offset (-2,-1) (-2,0) or (-1,-1) and new values introduced in order 0..2.at n=5A275503
• Number of 6 X n 0..2 arrays with no element equal to any value at offset (-2,-1) (-2,0) or (-1,-1) and new values introduced in order 0..2.at n=6A275506
• a(n) is the smallest centered n-gonal number with exactly n prime factors (counted with multiplicity).at n=6A358926