92380
domain: N
Appears in sequences
- "BGJ" (reversible, element, labeled) transform of 1,2,3,4...at n=8A032054
- a(n) = binomial(2*n-5,n-2) + 2.at n=12A052473
- Difference between the sum of odd parts and the sum of even parts in all the partitions of n.at n=40A208477
- Number of Dyck n-paths all of whose ascents have lengths equal to 1 (mod 9).at n=19A212389
- Number of (n+1)X(3+1) 0..1 arrays with no element having a strict majority of its horizontal, vertical, diagonal and antidiagonal neighbors equal to one.at n=4A231801
- Number of (n+1)X(5+1) 0..1 arrays with no element having a strict majority of its horizontal, vertical, diagonal and antidiagonal neighbors equal to one.at n=2A231803
- T(n,k)=Number of (n+1)X(k+1) 0..1 arrays with no element having a strict majority of its horizontal, vertical, diagonal and antidiagonal neighbors equal to one.at n=23A231806
- T(n,k)=Number of (n+1)X(k+1) 0..1 arrays with no element having a strict majority of its horizontal, vertical, diagonal and antidiagonal neighbors equal to one.at n=25A231806
- a(n) = Sum_{k=0..n} binomial(k, 9*(n-k)).at n=20A306753
- a(n) = Sum_{k=0..floor(5*n/9)} binomial(k,5*n-9*k).at n=36A392356