78078
domain: N
Appears in sequences
- Distinct even elements in the 5-Pascal triangle A028313.at n=37A028320
- Even elements to the right of the central elements of the 5-Pascal triangle A028313.at n=26A028321
- Triangle of numbers of Dyck paths.at n=39A039797
- Triangle read by rows: numbers of Dyck paths.at n=41A039798
- Closed walks of length n along the edges of a dodecahedron based at a vertex.at n=13A054882
- Number of walks of length n along the edges of a dodecahedron between two opposite vertices.at n=13A054883
- Numbers k which can be split into two numbers x and y such that x^3 + y^2 is a multiple of k.at n=46A162451
- Triangle V(l,p) (l>=0, p=0..l) read by rows: see Formula for definition, see Comments for motivation.at n=94A179898
- Successive integers produced by Conway's PRIMEGAME using Kilminster's Fractran program with only nine fractions.at n=38A183132
- Number of -n..n arrays x(0..3) of 4 elements with zero sum, adjacent elements differing by more than one, and elements alternately increasing and decreasing.at n=32A200193
- Triangle read by rows: the X-transformation of the Catalan triangle A033184.at n=30A228334
- Expansion of 1/((1+x)*(1+2*x)*(1-3*x)).at n=11A249992
- T(n, k) = (k*(2*k+2)*(2*k+1)*(2*n-1)*binomial(2*(n-1),n-1))/(n*(n+1)*(n+2)) for n, k > 0 and T(0, 0) = 1. Triangle read by rows, for 0 <= k <= n.at n=42A337994
- Number T(n,k) of partitions of [n] for which the difference between the longest and the shortest block size is k; triangle T(n,k), n>=0, 0<=k<=max(0,n-2), read by rows.at n=51A364971
- a(n) is the number of ways to partition an n X n X n cube into 4 noncongruent cuboids.at n=42A384311
- a(n) is the number of ways to partition an n X n X n cube into four noncongruent cuboids of different volumes.at n=42A385580