105026
domain: N
Appears in sequences
- Sequence defined by the recurrence formula a(n+1)=sum(a(p)*a(n-p)+k,p=0..n)+l for n>=1, with here a(0)=1, a(1)=8, k=1 and l=-1.at n=7A177178
- Number of length n+2 0..5 arrays with no three consecutive terms having the sum of any two elements equal to twice the third.at n=4A248458
- T(n,k)=Number of length n+2 0..k arrays with no three consecutive terms having the sum of any two elements equal to twice the third.at n=40A248461
- Number of length 5+2 0..n arrays with no three consecutive terms having the sum of any two elements equal to twice the third.at n=4A248466