67635
domain: N
Appears in sequences
- G.f.: Sum_{n>=0} a(n)*x^n/n!^4 = [ Sum_{n>=0} x^n/n!^4 ]^3.at n=4A172434
- Triangular array read by rows. T(n,k) is the number of digraphs with n labeled nodes having exactly k undirected (or weak) components, n >= 1, 1 <= k <= n.at n=17A189898
- Nonnegative values x of solutions (x, y) to the Diophantine equation x^2 + (x+433)^2 = y^2.at n=10A207061
- Number of n-length words on infinite alphabet {1,2,...} such that the maximal runs of consecutive equal integers have lengths that are at least as great as the integer.at n=15A242551
- a(n) = Sum_{k=0..n} Sum_{j=0..k} (binomial(n,k) * binomial(k,j))^n.at n=4A336270
- Numbers that are the sum of six fourth powers in exactly six ways.at n=28A345818