28860

Appears in sequences

• Number of n-step walks on square lattice in the first quadrant which finish at distance n-3 from the x-axis.at n=36A005564
• Coordination sequence for 6-dimensional lonsdaleite.at n=10A008526
• a(n) = n^3 - n^2 + n - 1 = (n-1) * (n^2 + 1).at n=31A062158
• Triangle, read by rows, of the coefficients of [x^k] in G100234(x)^n such that the row sums are 6^n-1 for n>0, where G100234(x) is the g.f. of A100234.at n=40A100235
• Maximal troughs in decimal expansions of Pi: positions of troughs equal to 8.at n=28A105276
• O.g.f.: A(x) = Sum_{n>=0} x^n*Product_{k=0..n} (1 + k*x)^2.at n=9A124383
• G.f. satisfies: A(x) = (1+y)*A(y^2) where y = x*A(x).at n=10A145072
• Positive integers n such that n^2 = (x^4 - y^4)*(z^4 - t^4) where the pairs of integers (x,y) and (z,t) are not proportional.at n=22A147854
• Triangle: q=3; m=2; t(n,k)=If[m == 0, n!, Product[Sum[(-1)^i*StirlingS2[ k - 1, i]*(m + 1)^i, {i, 0, k - 1}], {k, 1, n}]]; b(n,k,m)=If[n == 0, 1, t[n, m]/(t[k, m]*t[n - k, m])].at n=39A156594
• Triangle: q=3; m=2; t(n,k)=If[m == 0, n!, Product[Sum[(-1)^i*StirlingS2[ k - 1, i]*(m + 1)^i, {i, 0, k - 1}], {k, 1, n}]]; b(n,k,m)=If[n == 0, 1, t[n, m]/(t[k, m]*t[n - k, m])].at n=41A156594
• Earliest sequence such that (x+y) | a(xy) for all x>=1, y>=1.at n=35A169901
• Number of strings of numbers x(i=1..7) in 0..n with sum i*x(i)^2 equal to n*49.at n=10A184446
• Number of (n+1) X (2+1) 0..7 arrays with every 2 X 2 subblock having its diagonal sum differing from its antidiagonal sum by 4 (constant-stress 1 X 1 tilings).at n=1A234668
• T(n,k) is the number of (n+1) X (k+1) 0..7 arrays with every 2 X 2 subblock having its diagonal sum differing from its antidiagonal sum by 4 (constant-stress 1 X 1 tilings).at n=4A234672
• Number of length n+5 0..5 arrays with no six consecutive terms having the maximum of any three terms equal to the minimum of the remaining three terms.at n=0A250011
• T(n,k)=Number of length n+5 0..k arrays with no six consecutive terms having the maximum of any three terms equal to the minimum of the remaining three terms.at n=10A250014
• Number of length 1+5 0..n arrays with no six consecutive terms having the maximum of any three terms equal to the minimum of the remaining three terms.at n=4A250015
• a(n) = n*(n + 11)*(n + 22)*(n + 33)/24.at n=15A264448
• The first of 33 consecutive positive integers the sum of the squares of which is a square.at n=11A269449
• Numbers k such that 4*10^k - 89 is prime.at n=20A290475