Search: seq:1,1,4,15,63,280,1297,6193,30268,150687
|
|
Sorry, but the terms do not match anything in the table.
The following advanced matches exist for the numeric terms in your query.
If your sequence is of general interest, please submit it using the form provided and it will (probably) be added to the OEIS! Include a brief description and if possible enough terms to fill 3 lines on the screen. We need at least 4 terms.
|
| |
| |
| |
|
|
| |
| |
| | Transformations to other sequences
| |
|
These sequences match transformations of the original query.
inversion b(n) where 1 + sum b(n) x^n = 1 / (1 - sum a(n) x^n)
= 1, 2, 7, 28, 121, 550, 2591, 12536, 61921, 310954
- A010683 Let S(x,y) = number of lattice paths from (0,0) to (x,y) that use the step set { (0,1), (1,0), (2,0), (3,0), ...} and never pass below y = x. Sequence gives S(n-1,n) = number of 'Schröder' trees with n+1 leaves and root of degree 2.
(1, 2, 7, 28, 121, 550, 2591, 12536, 61921, 310954)
|
Search completed in 1.631 seconds
|
