19512

Appears in sequences

• a(n) = a(n-1)+a(n-2)+a(n-3)+2 with a(0)=0, a(1)=0 and a(2)=1.at n=17A089068
• 3^n-Jacobsthal(n).at n=9A093833
• A Fibonacci-Pell convolution.at n=11A106515
• Diagonal sums of Riordan array (1/(1+x),x(1+x)/(1-x)).at n=19A112476
• a(n) is the floor of the first component of M^n * (0, 1, 2, 3) where M is the matrix [[c, 1/2, 1/2, 1/2], [1/2, c, 1/2, 1/2], [1/2, 1/2, c, 1/2], [1/2, 1/2, 1/2, c]] and c=sqrt(3)/2.at n=11A121811
• Convolution of A039599 with itself .at n=29A152038
• Number of columns with top entry equal to bottom entry in all the 2-compositions of n. A 2-composition of n is a nonnegative matrix with two rows, such that each column has at least one nonzero entry and whose entries sum up to n.at n=9A181300
• Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 421", based on the 5-celled von Neumann neighborhood.at n=30A272051
• Non-repdigit numbers k that divide A045876(k).at n=10A276413
• Numbers n such that n * x/(x-1) produces a rotation of the digits in n for some value of x.at n=22A288669
• The number of rectangular free polyominoes with n cells where no 4 cells meet at a point.at n=10A326301