32900

Appears in sequences

• a(n) = Sum_{k=0..floor((n-3)/2)} T(n,k) * T(n,k+3), with T given by A026022.at n=7A027297
• Number of transitions necessary for a Turing machine to compute the differences between consecutive primes (primes written in unary), when using the instruction table below.at n=30A078612
• Sequence whose Hankel transform is the Somos (4) sequence.at n=10A173993
• Number of closed paths of length n whose steps are 14th roots of unity, U_14(n).at n=6A198806
• Number of (w,x,y,z) with all terms in {1,...,n} and 2w=x+y+z.at n=43A212068
• Positive integers n such that (n+21)^3 - n^3 is a square.at n=3A263943
• Numbers n for which A019565(n) <= A087207(n) < n.at n=12A286612