22412

Appears in sequences

• Triangle of numbers of hybrid rooted trees (divided by Fibonacci numbers).at n=49A011274
• a(n) = 2 + floor((1 + Sum_{j=1..n-1} a(j))/4).at n=42A120161
• Augmentation of the Fibonacci triangle A193588. See Comments.at n=50A193589
• Number of nX3 0..1 arrays avoiding 0 1 0 horizontally and 1 0 1 vertically.at n=5A206878
• Number of nX6 0..1 arrays avoiding 0 1 0 horizontally and 1 0 1 vertically.at n=2A206881
• T(n,k)=Number of nXk 0..1 arrays avoiding 0 1 0 horizontally and 1 0 1 vertically.at n=30A206883
• T(n,k)=Number of nXk 0..1 arrays avoiding 0 1 0 horizontally and 1 0 1 vertically.at n=33A206883
• Number of nX6 0..1 arrays avoiding 0 1 0 horizontally and 0 1 1 vertically.at n=2A206998
• T(n,k)=Number of nXk 0..1 arrays avoiding 0 1 0 horizontally and 0 1 1 vertically.at n=30A207000
• G.f. A(x) satisfies A(x) = 1 + x / (1 - x * A(x^2)).at n=23A218032
• Number of nX4 0..3 arrays with no element equal to one plus the sum of elements to its left or one plus the sum of elements above it or one plus the sum of the elements diagonally to its northwest or zero plus the sum of the elements antidiagonally to its northeast, modulo 4.at n=5A240150
• T(n,k)=Number of nXk 0..3 arrays with no element equal to one plus the sum of elements to its left or one plus the sum of the elements above it or one plus the sum of the elements diagonally to its northwest or zero plus the sum of the elements antidiagonally to its northeast, modulo 4.at n=41A240153
• Number of 6Xn 0..3 arrays with no element equal to one plus the sum of elements to its left or one plus the sum of the elements above it or one plus the sum of the elements diagonally to its northwest or zero plus the sum of the elements antidiagonally to its northeast, modulo 4.at n=3A240158