923520
domain: N
Appears in sequences
- a(n) = Sum_{d|n, n/d=1 mod 4} d^4 - Sum_{d|n, n/d=3 mod 4} d^4.at n=30A050468
- Jordan function J_4(n).at n=30A059377
- Number of paths of length n between two arbitrary, distinct vertices in K7, the complete graph on 7 vertices.at n=10A108509
- a(n) = n^4 - 1.at n=30A123865
- a(n) = (-1)^n * Sum_{2*m + 1 | 2*n + 1} (-1)^m (2*m + 1)^4.at n=15A204342
- a(n) = n^4 * Sum_{d|n} (-1)^(n/d + 1) * mu(d) / d^4.at n=30A338549
- Triangle read by rows: T(n,k) = number of open trails of length k starting and ending at fixed distinct vertices in the complete undirected graph on n labeled vertices, for n >= 1 and k = 0 .. n*(n-1)/2.at n=52A357886
- Even positive numbers that are one less than the square of a perfect power.at n=18A389955