18612

Appears in sequences

• Number of axially symmetric polyominoes with n cells.at n=17A006746
• Number of labeled 3-node T_0-hypergraphs with n hyperedges (empty hyperedges and multiple hyperedges included).at n=10A059585
• a(n) = Sum_{r|n, s|n, t|n, r<s<t} r*s*t.at n=44A067817
• Number of configurations of the sliding block 8-puzzle that require a minimum of n moves to be reached, starting with the empty square in the center.at n=20A089474
• Triangle read by rows: T(n,k) is the number of Motzkin paths of length n having k ascents (0<=k<=floor(n/2)); an ascent is a maximal string of upsteps.at n=58A114580
• Records in A139251.at n=49A152768
• a(n) = 2662*n - 22.at n=6A157609
• Triangle T, read by rows, where T(n,k) = [T^n](n-k-1,0); i.e., where row n of T equals the initial n terms of column 0 in matrix power T^n, reversed and with an appended '1', for n>0, with T(0,0)=1.at n=38A167015
• Column 2 of triangle T=A167015: a(n) = T(n+2,2) = [T^(n+2)](n-1,0) for n>0 with a(0)=1.at n=6A167018
• a(n) = n*(14*n + 13).at n=36A195028
• Nonnegative values x of solutions (x, y) to the Diophantine equation x^2+(x+329)^2 = y^2.at n=23A205672
• Number of (n+1)X(1+1) 0..2 arrays with the maximum plus the upper median plus the lower median of every 2X2 subblock differing from its horizontal and vertical neighbors by exactly one.at n=4A237696
• Number of (n+1)X(5+1) 0..2 arrays with the maximum plus the upper median plus the lower median of every 2X2 subblock differing from its horizontal and vertical neighbors by exactly one.at n=0A237700
• T(n,k)=Number of (n+1)X(k+1) 0..2 arrays with the maximum plus the upper median plus the lower median of every 2X2 subblock differing from its horizontal and vertical neighbors by exactly one.at n=10A237703
• T(n,k)=Number of (n+1)X(k+1) 0..2 arrays with the maximum plus the upper median plus the lower median of every 2X2 subblock differing from its horizontal and vertical neighbors by exactly one.at n=14A237703
• Positive even numbers which are neither of the form p + 2^m + 1 nor of the form p + 2^m - 1 with p prime.at n=27A270446
• Positions of squares in A276573.at n=47A277014
• a(n) = 12*n^2 + 10*n - 30.at n=39A277982
• p-INVERT of the positive integers, where p(S) = 1 - 3*S^2.at n=8A290906
• G.f. A(x) satisfies: Sum_{n>=0} Product_{k=1..n} (n+1-k)*x + k*A(x) = 1.at n=8A306087