18055

Appears in sequences

• 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), (-1, 0, 0), (-1, 1, -1), (0, 0, 1), (1, 0, -1)}.at n=11A148119
• 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, 0), (-1, 1, -1), (0, 0, -1), (0, 0, 1), (1, 0, 1)}.at n=8A150301
• Number of nX5 0..1 arrays avoiding 0 0 0 and 0 1 1 horizontally and 0 1 1 and 1 0 1 vertically.at n=5A207266
• T(n,k)=Number of nXk 0..1 arrays avoiding 0 0 0 and 0 1 1 horizontally and 0 1 1 and 1 0 1 vertically.at n=50A207269
• Number of 6Xn 0..1 arrays avoiding 0 0 0 and 0 1 1 horizontally and 0 1 1 and 1 0 1 vertically.at n=4A207273
• Numbers n such that the three numbers pi(n), pi(n^2), and pi(n^3) are prime.at n=9A233463
• Expansion of Product_{k>=1} 1/(1 - x^k)^(k*((k-2)^2+k)/2).at n=11A294958
• Expansion of Product_{k>=1} (1 + x^k/(1 + x^(2*k)/(1 + x^(3*k)))).at n=59A327718
• a(n) is the smallest positive integer which can be represented as the sum of distinct nonzero n-gonal pyramidal numbers in exactly n ways, or 0 if no such integer exists.at n=12A350210