54208

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)=6, k=1 and l=1.at n=7A177122
• Number of 6-step self-avoiding walks on an n X n square summed over all starting positions.at n=15A188151
• Number of n X 7 0..1 arrays avoiding 0 0 0 and 1 0 1 horizontally and 0 0 1 and 1 0 1 vertically.at n=5A207168
• Number of 6 X n 0..1 arrays avoiding 0 0 0 and 1 0 1 horizontally and 0 0 1 and 1 0 1 vertically.at n=6A207174
• Number of (2+1) X (n+1) 0..3 arrays with nondecreasing x(i,j)-x(i,j-1) in the i direction and nondecreasing x(i,j)+x(i-1,j) in the j direction.at n=8A250879
• Sum of positive divisors of A000032(n).at n=22A272439
• Sum of odd divisors of Lucas(n).at n=21A280108
• Number of chiral pairs of color patterns (set partitions) for a row of length n using 6 or fewer colors (subsets).at n=9A320936
• Triangle read by rows: T(n,k) is the number of primes in the half-open interval [10^n, 10^n + 10^k), n >= 1, 1 <= k <= n.at n=33A323744
• Number of symmetric subsets of {1,..,2n} for which the reciprocal of the modular-part product is also a modular-part product.at n=14A329778