25854

Appears in sequences

• Grow a binary tree using the following rules. Initially there is a single node labeled 1. At each step we add 1 to all labels less than 3. If a node has label 3 and zero or one descendants we add a new descendant labeled 1. Sequence gives sum of all labels at step n.at n=44A123015
• Number of (n+2)X4 binary arrays with each 3X3 subblock nonsingular.at n=2A185527
• Number of (n+2)X5 binary arrays with each 3X3 subblock nonsingular.at n=1A185528
• T(n,k)=Number of (n+2)X(k+2) binary arrays with each 3X3 subblock nonsingular.at n=7A185534
• T(n,k)=Number of (n+2)X(k+2) binary arrays with each 3X3 subblock nonsingular.at n=8A185534
• Number of nondecreasing strings of numbers x(i=1..7) in -n..n with sum x(i)^3 equal to 0.at n=30A188281
• Constant term of the reduction by x^2->x+1 of the polynomial p(n,x) defined at Comments.at n=14A193008
• Number of (n+2)X(5+2) 0..1 arrays with every 3X3 subblock sum of the two medians of the central row and column plus the two sums of the diagonal and antidiagonal nondecreasing horizontally, vertically and ne-to-sw antidiagonally.at n=27A259003
• Expansion of 1 / ((1-x)^2*(1-x^2)*(1-x^3)*...*(1-x^7)).at n=35A288342
• Number of partitions of the n-th nonprime number into a nonprime number of nonprime parts.at n=50A344789
• a(n) is the index of A384793(n) in A038618.at n=0A384794