26346

Appears in sequences

• a(n) = Sum{a(k): k=0,1,2,...,n-3,n-1}; a(n-2) is not a summand; 2 initial terms required.at n=18A049855
• Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, 1), (0, 1, -1), (0, 1, 1), (1, 0, 1), (1, 1, 0)}.at n=7A151201
• Number of n X 3 0..1 arrays avoiding 0 0 0 and 0 1 1 horizontally and 0 0 1 and 1 1 1 vertically.at n=11A207509
• Expansion of Product_{i>0, j>0, k>0} 1/(1 - x^(i^2 + j^2 + k^2)).at n=55A321433
• Triangle read by rows: T(n,k) is the number of unordered pairs of nodes at distance k in the n-Dorogovtsev-Goltsev-Mendes graph.at n=17A384844