19070

Appears in sequences

• Taylor series related to one in Ramanujan's Lost Notebook.at n=28A006305
• Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, 0), (-1, 0, 0), (0, 1, -1), (0, 1, 1), (1, 0, 0)}.at n=8A150160
• Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, 1), (0, 1, -1), (1, 0, 1), (1, 1, 1)}.at n=8A150390
• Number of binary strings of length n with equal numbers of 00110 and 10001 substrings.at n=15A164255
• Number of -3..3 arrays x(i) of n+1 elements i=1..n+1 with set{t,u,v in 0,1}((x[i+t]+x[j+u]+x[k+v])*(-1)^(t+u+v)) having two, three, four, six or seven distinct values for every i,j,k<=n.at n=5A211740
• Records in A096335 (values).at n=35A221181
• Number of partitions n such that the multiplicity of the number of odd parts is a part.at n=45A240541
• Number of maximal subsets of {1..n} such that it is possible to choose a different binary index of each element.at n=22A370640