26129

Appears in sequences

• a(n) = n^3 - n^2 + n - 1 = (n-1) * (n^2 + 1).at n=30A062158
• a(1) = 1, then smallest number not included earlier such that a(n)*a(n+1) + 1 is an n-th power.at n=4A083205
• Structured truncated octahedral numbers.at n=16A100155
• Expansion of x/((4*x-1)*(2*x-1)*(x+1)).at n=8A109765
• a(n) = A000041(n) + n*A032741(n).at n=38A168015
• Number of n X 4 arrays of the minimum value of corresponding elements and their horizontal, vertical, diagonal or antidiagonal neighbors in a random, but sorted with lexicographically nondecreasing rows and columns, 0..1 n X 4 array.at n=13A219350
• Number of (n+2)X(4+2) 0..3 arrays with every 3X3 subblock row and column sum equal to 2 3 4 6 or 7 and every 3X3 diagonal and antidiagonal sum not equal to 2 3 4 6 or 7.at n=4A252163
• Number of (n+2)X(5+2) 0..3 arrays with every 3X3 subblock row and column sum equal to 2 3 4 6 or 7 and every 3X3 diagonal and antidiagonal sum not equal to 2 3 4 6 or 7.at n=3A252164
• T(n,k)=Number of (n+2)X(k+2) 0..3 arrays with every 3X3 subblock row and column sum equal to 2 3 4 6 or 7 and every 3X3 diagonal and antidiagonal sum not equal to 2 3 4 6 or 7.at n=31A252167
• T(n,k)=Number of (n+2)X(k+2) 0..3 arrays with every 3X3 subblock row and column sum equal to 2 3 4 6 or 7 and every 3X3 diagonal and antidiagonal sum not equal to 2 3 4 6 or 7.at n=32A252167
• Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 470", based on the 5-celled von Neumann neighborhood.at n=40A272421
• Number of n X 5 0..1 arrays with each 1 horizontally, vertically or antidiagonally adjacent to 3 or 6 neighboring 1s.at n=18A296551
• Numbers that set a record for occurrences as longest side of a primitive Heronian triangle.at n=27A306626
• a(n) = Sum_{k=1..n} floor(n/k)^3.at n=27A318742
• Numerators of the partial sums of the reciprocals of the 3rd Piltz function d_3(n) (A007425).at n=35A379357