171360

Appears in sequences

• a(1)=1; a(n) = n!*Fibonacci(n+2), n > 1.at n=6A005922
• Numbers k such that sigma(k) >= 4*k.at n=27A023198
• Numbers k such that sigma(k) > 4*k.at n=25A068404
• Number of symmetric ways to lace a shoe that has n pairs of eyelets such that each eyelet has at least one direct connection to the opposite side.at n=7A078700
• Denominator of G(n) = Sum_{k=1..n} (1/(2*2^k)) * Sum_{j=0..k-1} 1/binomial(2^(k-j)+j,j).at n=4A085116
• First column of triangle A113463.at n=17A113464
• Triangle T(n,k), 1<=k<=n, read by rows given by T(n,k) = A003266(n)/A000045(k).at n=42A121284
• a(n) = 529*n^2 - 2*n.at n=17A158364
• a(n+1) = A001610(n)*a(n).at n=6A196870
• Triangle T(n,m) = coefficient of x^n in expansion of [x*(x+1)^(x+1)]^m = sum(n>=m, T(n,m) x^n*m!/n!).at n=40A202190
• G.f.: Sum_{n>=0} (n-2*x)^n * x^n / (1 + n*x - 2*x^2)^n.at n=8A203799
• Array: row n shows the coefficients of the characteristic polynomial of the n-th principal submatrix of f(i,j)=(L(i) if i=j and 1 otherwise) (A204129).at n=27A204130
• Numbers n whose divisors can be partitioned into four disjoint sets whose sums are all sigma(n)/4.at n=26A204831
• Numbers with abundancy 4 <= sigma(n)/n < 5.at n=27A230608
• Records in A187202 by index.at n=42A242393
• T(n,k) is the number of labeled graphs of n vertices and k edges that have endpoints, where an endpoint is a vertex with degree 1.at n=33A245796
• Consider numbers n = concat(x,y,z) such that the product x*y*z | n. Leading zeros in y and z allowed. Sequence lists numbers that admit different concatenations.at n=26A256518
• Consider numbers n = concat(w,x,y,z) such that w*x*y*z | n. Leading zeros in x, y and z allowed. Sequence lists numbers that admit at least two such concatenations.at n=30A257172
• T(n,k)=Number of nXk arrays containing k copies of 0..n-1 with every element equal to at least one horizontal or vertical neighbor and the top left element equal to 0.at n=43A267901
• Imaginary part of (n + i)^4.at n=35A272871