115920

Appears in sequences

• Expansion of (1+x)^2/(1-18*x+x^2).at n=4A004292
• Numbers k such that sigma(k) >= 4*k.at n=16A023198
• Expansion of e.g.f. 1/(1-x-2*x^3).at n=7A052610
• Exponential transform of Pascal's triangle A007318.at n=38A055883
• Exponential transform of Pascal's triangle A007318.at n=42A055883
• Numbers k such that sigma(k) > 4*k.at n=14A068404
• One half of third column of triangle A075181.at n=5A075183
• Smallest perimeter S such that exactly n distinct Pythagorean triangles with this perimeter can be constructed.at n=35A099830
• a(n) = Bell(n) - Fibonacci(n).at n=10A100389
• Values of n*d(k)*sopf(k) associated with A134382.at n=29A134386
• a(1)=1. a(n) is the smallest positive multiple of n that has more divisors than a(n-1) has.at n=22A143176
• Number of n X 2 binary arrays with all 1s connected, a path of 1s from upper left corner to lower right corner, and no 1 having more than two 1s adjacent.at n=23A163685
• Numbers with prime factorization pqrs^2t^4.at n=7A190384
• Table read by rows: The coefficients of the polynomials P(n, x) = Sum_{k=0..n} Sum_{j=0..k} (-1)^j * 2^(-k) * binomial(k, j) * (k-2*j)^n * x^(n-k).at n=49A193474
• Triangle T(n,k) gives the number of ordered partitions of an n set into k odd-sized blocks.at n=40A196776
• Numbers n whose divisors can be partitioned into four disjoint sets whose sums are all sigma(n)/4.at n=16A204831
• Integer areas A of integer-sided cyclic quadrilaterals such that the circumradius is of prime length.at n=30A230136
• Numbers with abundancy 4 <= sigma(n)/n < 5.at n=16A230608
• Triangular array: row n gives the coefficients of the polynomial p(n,x) defined in Comments.at n=26A249253
• Number of length-n 0..n arrays with every repeated value unequal to the previous repeated value plus one mod n+1.at n=5A269770