Sequences
392,541 sequences
- a(n) = n^2*(n+1)*(n+3)!/48.A037961
a(n) = n^2*(n+1)*(n+3)!/48.
- a(n) = n*(15*n^3 + 30*n^2 + 5*n - 2)*(n+4)!/5760.A037962
a(n) = n*(15*n^3 + 30*n^2 + 5*n - 2)*(n+4)!/5760.
- a(n) = n^2*(n+1)*(3*n^2 + 7*n - 2)*(n+5)!/11520.A037963
a(n) = n^2*(n+1)*(3*n^2 + 7*n - 2)*(n+5)!/11520.
- a(n) = (1/2)*(binomial(4*n, 2*n) - (-1)^n*binomial(2*n,n)).A037964
a(n) = (1/2)*(binomial(4*n, 2*n) - (-1)^n*binomial(2*n,n)).
- a(n) = n*binomial(2*n-2, n-1).A037965
a(n) = n*binomial(2*n-2, n-1).
- a(n) = n^2*binomial(2*n-2, n-1).A037966
a(n) = n^2*binomial(2*n-2, n-1).
- a(n) = (binomial(2*n, n)^2 + binomial(2*n, n))/2.A037967
a(n) = (binomial(2*n, n)^2 + binomial(2*n, n))/2.
- Greatest number of distinct digits of n in any base b>=2.A037968
Greatest number of distinct digits of n in any base b>=2.
- Numbers whose maximal base-2 run length is 2.A037969
Numbers whose maximal base-2 run length is 2.
- Numbers whose maximal base-2 run length is 3.A037970
Numbers whose maximal base-2 run length is 3.
- Numbers whose maximal base-2 run length is 4.A037971
Numbers whose maximal base-2 run length is 4.
- a(n) = n^2*(n+1)*binomial(2*n-2, n-1)/2.A037972
a(n) = n^2*(n+1)*binomial(2*n-2, n-1)/2.
- Numbers whose maximal base 3 run length is 2.A037973
Numbers whose maximal base 3 run length is 2.
- Numbers whose maximal base-3 run length is 3.A037974
Numbers whose maximal base-3 run length is 3.
- Maximal base 3 run length is 4.A037975
Maximal base 3 run length is 4.
- a(n) = (1/4)*(binomial(4*n, 2*n) - (-1)^n*binomial(2*n, n) + (1-(-1)^n)*binomial(2*n, n)^2).A037976
a(n) = (1/4)*(binomial(4*n, 2*n) - (-1)^n*binomial(2*n, n) + (1-(-1)^n)*binomial(2*n, n)^2).
- Numbers whose maximal base 4 run length is 2.A037977
Numbers whose maximal base 4 run length is 2.
- Numbers whose maximal base 4 run length is 3.A037978
Numbers whose maximal base 4 run length is 3.
- Numbers whose maximal base-4 run length is 4.A037979
Numbers whose maximal base-4 run length is 4.
- a(n) = (1/16)*( binomial(4*n, 2*n) - (-1)^n*binomial(2*n, n) + (1-(-1)^n)*binomial(2*n, n)^2 ).A037980
a(n) = (1/16)*( binomial(4*n, 2*n) - (-1)^n*binomial(2*n, n) + (1-(-1)^n)*binomial(2*n, n)^2 ).
- Maximal base 5 run length is 2.A037981
Maximal base 5 run length is 2.
- Numbers whose maximal base 5 run length is 3.A037982
Numbers whose maximal base 5 run length is 3.
- Maximal base 5 run length is 4.A037983
Maximal base 5 run length is 4.
- Maximum number of trapezoids that can be formed by n lines in plane.A037984
Maximum number of trapezoids that can be formed by n lines in plane.
- Numbers whose maximal base 6 run length is 2.A037985
Numbers whose maximal base 6 run length is 2.
- Numbers whose maximal base 6 run length is 3.A037986
Numbers whose maximal base 6 run length is 3.
- Numbers whose maximal base-6 run length is 4.A037987
Numbers whose maximal base-6 run length is 4.
- Critical values in Conway's game of one-dimensional phutball.A037988
Critical values in Conway's game of one-dimensional phutball.
- Numbers whose maximal base-7 run length is 2.A037989
Numbers whose maximal base-7 run length is 2.
- Numbers whose maximal base 7 run length is 3.A037990
Numbers whose maximal base 7 run length is 3.
- Maximal base 7 run length is 4.A037991
Maximal base 7 run length is 4.
- Smallest number with 2^n divisors.A037992
Smallest number with 2^n divisors.
- Numbers whose maximal base-8 run length is 2.A037993
Numbers whose maximal base-8 run length is 2.
- Numbers whose maximal base 8 run length is 3.A037994
Numbers whose maximal base 8 run length is 3.
- Numbers whose maximal base-8 run length is 4.A037995
Numbers whose maximal base-8 run length is 4.
- Decimal expansion of Pi*exp(2*Pi-Pi^2/2).A037996
Decimal expansion of Pi*exp(2*Pi-Pi^2/2).
- Numbers whose maximal base-9 run length is 2.A037997
Numbers whose maximal base-9 run length is 2.
- Numbers whose maximal base-9 run length is 3.A037998
Numbers whose maximal base-9 run length is 3.
- Numbers whose maximal base-9 run length is 4.A037999
Numbers whose maximal base-9 run length is 4.
- Number of forests of rooted trees where n dollars are spent and an n-node tree costs 2n-1 dollars.A038000
Number of forests of rooted trees where n dollars are spent and an n-node tree costs 2n-1 dollars.
- Inverse WEIGH transform of A038000.A038001
Inverse WEIGH transform of A038000.
- Number of connected functions on n points with a single labeled point.A038002
Number of connected functions on n points with a single labeled point.
- Odd Catalan numbers: a(n) = A000108(2^n-1).A038003
Odd Catalan numbers: a(n) = A000108(2^n-1).
- Least k such that A033178(k)=n.A038004
Least k such that A033178(k)=n.
- Odd k such that b(k) is less than b(k-1) and b(k+1). b(k): A033178.A038005
Odd k such that b(k) is less than b(k-1) and b(k+1). b(k): A033178.
- Differences of A038005.A038006
Differences of A038005.
- Even numbers k such that b(k) is greater than b(k-1) and b(k+1); b(k) = A033178(k).A038007
Even numbers k such that b(k) is greater than b(k-1) and b(k+1); b(k) = A033178(k).
- Differences of A038007.A038008
Differences of A038007.
- Values of A038007 not ending in 6 or 8.A038009
Values of A038007 not ending in 6 or 8.
- Differences of A038009.A038010
Differences of A038009.