19282

Appears in sequences

• a(n) = number of (s(0), s(1), ..., s(n)) such that every s(i) is an integer, s(0) = 0, |s(i) - s(i-1)| = 1 for i = 1,2; |s(i) - s(i-1)| <= 1 for i >= 3, s(n) = 3. Also a(n) = T(n,n-3), where T is the array defined in A024996.at n=9A026070
• a(n) = Sum_{k=0..2n-3} T(n,k) * T(n,k+3), with T given by A025177.at n=3A027260
• Expansion of psi(q^2) / f(-q)^2 in powers of q where psi(), f() are Ramanujan theta functions.at n=18A137829
• (Number of 4 X 4 pandiagonal magic squares with distinct positive entries less than n)/384.at n=29A317252
• Number of length-n binary strings that neither begin nor end with a square.at n=17A323442