31240

Appears in sequences

• Tetranacci numbers: a(n) = a(n-1) + a(n-2) + a(n-3) + a(n-4), with a(0)=a(1)=0, a(2)=1, a(3)=2.at n=18A001630
• a(n) = (n+1)*(n^2+n+2)/2; g.f.: (1 + 2*x^2) / (1 - x)^4.at n=39A006000
• a(n) = a(n-1) + a(n-2) + 1 for n>1, a(0)=0, a(1)=3.at n=20A022308
• Fishburn numbers: number of linearized chord diagrams of degree n; also number of nonisomorphic interval orders on n unlabeled points.at n=9A022493
• n written in fractional base 5/3.at n=40A024633
• a(n) = Sum_{k=0..floor(n/2)} A026615(n-k,k).at n=21A026625
• Character of extremal vertex operator algebra of rank 11.at n=5A028531
• Number of consecutive integers placed in n bins under a certain packing scheme.at n=10A031506
• Triangle T(n,d) read by rows: Number of ascent sequences of length n with d zeros.at n=45A175579
• Square excess of Fibonacci numbers.at n=49A190993
• Number of (n+2)X4 binary arrays avoiding patterns 001 and 111 in rows and columns.at n=5A202372
• Number of (n+2)X8 binary arrays avoiding patterns 001 and 111 in rows and columns.at n=1A202376
• T(n,k)=Number of (n+2)X(k+2) binary arrays avoiding patterns 001 and 111 in rows and columns.at n=22A202378
• T(n,k)=Number of (n+2)X(k+2) binary arrays avoiding patterns 001 and 111 in rows and columns.at n=26A202378
• Triangle read by rows: T(n,k) is the number of ascent sequences of length n with last zero at position k-1.at n=45A218579
• Triangle read by rows: T(n,k) is the number of ascent sequences of length n with last zero at position k-1.at n=54A218579
• Unmatched value maps: number of n X 2 binary arrays indicating the locations of corresponding elements not equal to any horizontal, vertical or antidiagonal neighbor in a random 0..2 n X 2 array.at n=7A219100
• T(n,k)=Unmatched value maps: number of nXk binary arrays indicating the locations of corresponding elements not equal to any horizontal, vertical or antidiagonal neighbor in a random 0..2 nXk array.at n=37A219106
• T(n,k)=Unmatched value maps: number of nXk binary arrays indicating the locations of corresponding elements not equal to any horizontal, vertical or antidiagonal neighbor in a random 0..2 nXk array.at n=43A219106
• T(n,k)=Unmatched value maps: number of nXk binary arrays indicating the locations of corresponding elements not equal to any horizontal, vertical or antidiagonal neighbor in a random 0..3 nXk array.at n=37A219985