31436

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(n), |s(i) - s(i-1)| = 1 for i = 1,2; |s(i) - s(i-1)| <= 1 for i >= 3. Also a(n) = T(n,n), where T is the array defined in A024996.at n=9A024997
• a(n) = self-convolution of row n of array T given by A025177.at n=6A027257
• Number of Sidon subsets of {1,...,n} of size 5.at n=27A241689
• Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 137", based on the 5-celled von Neumann neighborhood.at n=38A270276
• a(1) = 1; a(n) = Sum_{k=1..n} a(ceiling((n-1)/k)).at n=45A290845
• Numbers n such that there are precisely 11 groups of orders n and n + 1.at n=2A295994