104160

Appears in sequences

• Icosahedral numbers: a(n) = n*(5*n^2 - 5*n + 2)/2.at n=34A006564
• Maximal number of pairs of minimal vectors in n-dimensional laminated lattice.at n=32A028924
• Number of diagonal dissections of an n-gon into 3 regions.at n=31A033275
• First differences of A069474, successive differences of (n+1)^6-n^6.at n=15A069475
• B(n,k) an additive decomposition of (4^n-2^n)*B(n), B(n) the Bernoulli numbers (triangle read by rows).at n=33A154345
• Number of permutations of 5 indistinguishable copies of 1..n arranged in a circle with exactly 3 local maxima.at n=2A159735
• Numbers with prime factorization pqrst^5.at n=10A190383
• Array: row n shows the coefficients of the characteristic polynomial of the n-th principal submatrix of max(3i-j, 3j-i), as in A204156.at n=30A204157
• Triangular array read by rows: T(n,k) is the number of functions f:{1,2,...,n}->{1,2,...,n} with a height of k; n>=1, 0<=k<=n-1.at n=25A216242
• Triangular array read by rows. T(n,k) is the number of functions f:{1,2,...,n}->{1,2,...,n} that have exactly k recurrent elements whose preimage contains only one element, n>=0, 0<=k<=n.at n=31A220234
• Triangle of functions in a size n set for which the sequence of composition powers starts with a length k stem (index) before entering a cycle (period).at n=20A225540
• Numbers k such that k+1 is a prime, k+2 is twice a prime, k+3 is three times a prime, and k+4 is four times a prime.at n=6A278585
• Number of ways to connect n nodes with n+1 edges to form a 2-edge-connected graph.at n=4A290011
• Numbers i such that Fibonacci(i) is divisible by i, i+1, i+2, and i+3.at n=26A298685
• Numbers i such that Fibonacci(i) is divisible by i+k for k=0,1,2,3,4.at n=6A298686
• a(n) = (n-1)*(n-2)*(n+3)*(n+2)/12.at n=33A299120
• Triangular array read by rows. T(n,k) is the number of nilpotent n X n matrices over GF(2) with index k, 1 <= k <= n, n >= 1.at n=12A346214
• E.g.f. satisfies A(x) = 1 - x*A(x)^3 * log(1 - x).at n=7A371141