25123

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, 0), (-1, 0, 0), (0, 0, -1), (0, 1, 1), (1, -1, -1)}.at n=10A148596
• Number of dispersed Dyck paths of length n (i.e., of Motzkin paths of length n with no (1,0)-steps at positive heights) having no base pyramids. A base pyramid is a factor of the form U^j D^j (j>0), starting at the horizontal axis. Here U=(1,1) and D=(1,-1).at n=21A191393
• Number of zero-sum nX2 -2..2 arrays with every element equal to at least one horizontal or vertical neighbor.at n=5A201885
• T(n,k)=Number of zero-sum nXk -2..2 arrays with every element equal to at least one horizontal or vertical neighbor.at n=22A201888
• T(n,k)=Number of zero-sum nXk -2..2 arrays with every element equal to at least one horizontal or vertical neighbor.at n=26A201888
• Triangle read by rows: T(n,k) is the coefficient A_k in the transformation Sum_{k=0..n} (k+1)*x^k = Sum_{k=0..n} A_k*(x-3)^k.at n=51A246799
• Numbers k such that the sum of the divisors of k is of the form m^3 + 1.at n=32A289384
• a(n) = A159065(n+1) - A334701(n).at n=31A335677
• Setwise difference A340150 \ A340076.at n=46A340151
• a(n) is the index of the smallest n-gonal number with exactly n prime factors (counted with multiplicity).at n=14A359014