26430

Appears in sequences

• Numbers k such that usigma(k) is a square and sets a new record for such squares.at n=25A064443
• Number of n-node labeled weakly connected acyclic digraphs.at n=5A082402
• A higher order recursion triangle sequence: m=4;l=4;e(n,k,m)=(l*k + m - 1)e(n - 1, k, m) + (m*n - l*k + 1 - m)e(n - 1, k - 1, m).at n=17A156280
• Number of ordered triples (w,x,y) with all terms in {1,...,n} and 2w^3<=x^3+y^3.at n=35A211807
• Numbers n such that n+(n+1), n^2+(n+1)^2, n+(n+1)^2, n^2+(n+1) are all prime.at n=31A216270
• Number of 0..n arrays of length 6 with each element differing from at least one neighbor by 1 or less.at n=8A221598
• Number of (n+1) X (2+1) 0..1 arrays with nondecreasing x(i,j)+x(i,j-1) in the i direction and nondecreasing min(x(i,j),x(i-1,j)) in the j direction.at n=24A250723
• Expansion of Product_{k>=1} 1/(1 - x^k/(1 - x)^k)^k.at n=10A320563
• Number of integer partitions of n of even rank.at n=42A340601
• Triangle read by rows: T(n,k) is the number of weakly connected simple digraphs on n labeled nodes with k strongly connected components.at n=20A361591
• Triangular array read by rows: T(n,k) is the number of labeled acyclic digraphs on n vertices with exactly k weakly connected components, n>=0, 0<=k<=n.at n=16A380252