225225

Appears in sequences

• Triangle of coefficients of Legendre polynomials P_n (x).at n=44A008316
• a(n) = 7*(n+1)*binomial(n+6,7)/2.at n=8A027819
• Triangle read by rows giving number of ways to glue sides of a 2n-gon so as to produce a surface of genus g.at n=24A035309
• Right-hand diagonal of A035309.at n=8A035318
• Number of rooted maps of genus n with one vertex and one face; the maps are considered on orientable surfaces and contain 2n edges.at n=4A035319
• Highly composite odd numbers: odd numbers where d(n) increases to a record.at n=18A053624
• Sum of binary numbers with n 1's and two (possibly leading) 0's.at n=10A059937
• Boundaries of primorial intervals [1,3]; [3,9],[9,15]; [15,45], etc.at n=24A065917
• a(1) = 7, a(n+1) = smallest multiple of a(n) using only prime digits(2,3,5,7).at n=4A078235
• a(n) = A092914(n)/n = the least integer value of (n-1)!/(n*k!).at n=10A092916
• Denominator of Sum_{k in A026424} 1/k^(2n).at n=2A093598
• Lexicographically earliest sequence of increasing numbers whose digits satisfy the "Fractal Jump" rule using only the digits 2 and 5: keep the first digit "d" of the sequence, then jump over the next "d" digits and keep the digit "e" on which you have landed. Jump now over the next "e" digits and keep the digit "f" on which you have landed, etc. The succession "def..." of kept digits is the sequence itself.at n=28A105647
• Smallest term in the Hofstadter sequence A005243 having exactly n representations as sum of consecutive earlier terms.at n=25A118166
• Oddly superabundant numbers: odd n with sigma(n)/n > sigma(k)/k for all odd k < n.at n=16A119239
• Terms in A038547 where prime signature differs from that of corresponding term in A005179.at n=4A122814
• Integer values of n!!/sum(i=0..n,n), with n>=1.at n=5A130332
• Increment each prime factor for each term of the least prime sequence A087443.at n=42A131801
• Increment each prime factor for each term of the least prime signature sequence derived from A080577.at n=42A131822
• Numerators of triangle T(n,k), n>=0, 0<=k<=n, read by rows: T(n,k) is the coefficient of x^(2k+1) in polynomial u_n(x), used to approximate x->sin(Pi*x)/Pi.at n=23A144846
• Numbers with exactly 5 distinct odd prime divisors {3,5,7,11,13}.at n=7A147578