159375

Appears in sequences

• Triangle of coefficients of polynomials (rising powers) useful for convolutions of A000204(n+1), n >= 0 (Lucas numbers).at n=18A061189
• Composites which use less than all of their digits in their prime factorization.at n=21A074211
• Numbers j that are the hypotenuse of exactly 16 distinct integer-sided right triangles, i.e., j^2 can be written as a sum of two squares in 16 ways.at n=8A097238
• Triangle read by rows: number of spanning trees obtained for an almost-complete bipartite graph by removing k disjoint edges from the complete bipartite graph K n,n with k<=n.at n=11A260383
• a(n) = n! * [x^n] exp(n*x)*BesselI(0,2*n*x).at n=5A294409
• a(1) = 1; thereafter a(n+1) > a(n) is the smallest multiple of a(n) using only odd digits but not divisible by 9.at n=6A329764