Sequences
392,541 sequences
- Decimal expansion of log_10 (Pi).A053511
Decimal expansion of log_10 (Pi).
- Half the number of non-self-intersecting paths from one corner of an n X n grid to the opposite corner.A053512
Half the number of non-self-intersecting paths from one corner of an n X n grid to the opposite corner.
- Number of 2-multigraphs with loops on n nodes.A053513
Number of 2-multigraphs with loops on n nodes.
- Number of 3-multigraphs with loops on n nodes.A053514
Number of 3-multigraphs with loops on n nodes.
- Number of connected directed 3-multigraphs on n nodes.A053515
Number of connected directed 3-multigraphs on n nodes.
- Number of directed 4-multigraphs with loops on n nodes.A053516
Number of directed 4-multigraphs with loops on n nodes.
- Number of connected directed 2-multigraphs on n nodes.A053517
Number of connected directed 2-multigraphs on n nodes.
- Numerators of successive convergents to continued fraction 1+2/(3+3/(4+4/(5+5/(6+6/(7+7/(8+8/(9+9/10+...))))))).A053518
Numerators of successive convergents to continued fraction 1+2/(3+3/(4+4/(5+5/(6+6/(7+7/(8+8/(9+9/10+...))))))).
- Denominators of successive convergents to continued fraction 1+2/(3+3/(4+4/(5+5/(6+6/(7+7/(8+8/(9+9/10+...))))))).A053519
Denominators of successive convergents to continued fraction 1+2/(3+3/(4+4/(5+5/(6+6/(7+7/(8+8/(9+9/10+...))))))).
- Denominators of successive convergents to continued fraction 1/(2+2/(3+3/(4+4/(5+5/(6+6/(7+7/(8+8/9+...))))))).A053520
Denominators of successive convergents to continued fraction 1/(2+2/(3+3/(4+4/(5+5/(6+6/(7+7/(8+8/9+...))))))).
- a(n) = floor(A*a(n-1) + B*a(n-2) + C)/p^r, where p^r is the highest power of p dividing floor(A*a(n-1) + B*a(n-2) + C), A=1.0001, B=1.0001, C=1, p=2.A053521
a(n) = floor(A*a(n-1) + B*a(n-2) + C)/p^r, where p^r is the highest power of p dividing floor(A*a(n-1) + B*a(n-2) + C), A=1.0001, B=1.0001, C=1, p=2.
- a(n)=[A*a(n-1)+B*a(n-2)+C]/p^r, where p^r is the highest power of p dividing [A*a(n-1)+B*a(n-2)+C], A=1.0001, B=1.0001, C=1.5, p=2.A053522
a(n)=[A*a(n-1)+B*a(n-2)+C]/p^r, where p^r is the highest power of p dividing [A*a(n-1)+B*a(n-2)+C], A=1.0001, B=1.0001, C=1.5, p=2.
- a(n)=[A*a(n-1)+B*a(n-2)+C]/p^r, where p^r is the highest power of p dividing [A*a(n-1)+B*a(n-2)+C], A=1.0001, B=1.0001, C=1.9, p=2.A053523
a(n)=[A*a(n-1)+B*a(n-2)+C]/p^r, where p^r is the highest power of p dividing [A*a(n-1)+B*a(n-2)+C], A=1.0001, B=1.0001, C=1.9, p=2.
- a(n) = (6^n - (-2)^n)/8.A053524
a(n) = (6^n - (-2)^n)/8.
- Expansion of e.g.f.: (1-x)/(2-exp(x)).A053525
Expansion of e.g.f.: (1-x)/(2-exp(x)).
- Number of bipartite graphs with 3 edges on nodes {1..n}.A053526
Number of bipartite graphs with 3 edges on nodes {1..n}.
- Number of bipartite graphs with 4 edges on nodes {1..n}.A053527
Number of bipartite graphs with 4 edges on nodes {1..n}.
- Number of bipartite graphs with 5 edges on nodes {1..n}.A053528
Number of bipartite graphs with 5 edges on nodes {1..n}.
- a(n) = n! * number of partitions of n.A053529
a(n) = n! * number of partitions of n.
- Expansion of e.g.f.: exp(-x - x^2/2 + x*exp(x)).A053530
Expansion of e.g.f.: exp(-x - x^2/2 + x*exp(x)).
- Expansion of e.g.f.: (1-x)^(-x/2)*exp(-x^2*(4 +2*x +x^2)/8).A053531
Expansion of e.g.f.: (1-x)^(-x/2)*exp(-x^2*(4 +2*x +x^2)/8).
- Expansion of e.g.f.: (1-x)^(-1/2)*exp(-x/2 -x^2/4 -x^3/6).A053532
Expansion of e.g.f.: (1-x)^(-1/2)*exp(-x/2 -x^2/4 -x^3/6).
- Expansion of e.g.f.: (1-x)^(-1/2)*exp(-x/2 -x^2/4 -x^3/6 -x^4/8).A053533
Expansion of e.g.f.: (1-x)^(-1/2)*exp(-x/2 -x^2/4 -x^3/6 -x^4/8).
- Triangle T(n,k) giving number of pairwise non-isomorphic (i.e., unlabeled) matroids of rank k on n points (n >= 0, 0 <= k <= n).A053534
Triangle T(n,k) giving number of pairwise non-isomorphic (i.e., unlabeled) matroids of rank k on n points (n >= 0, 0 <= k <= n).
- Expansion of 1/((1+3*x)*(1-9*x)).A053535
Expansion of 1/((1+3*x)*(1-9*x)).
- Expansion of 1/((1+4*x)*(1-12*x)).A053536
Expansion of 1/((1+4*x)*(1-12*x)).
- Expansion of 1/((1+5*x)*(1-15*x)).A053537
Expansion of 1/((1+5*x)*(1-15*x)).
- Triangle: a(n,m) = ways to place p balls in n slots with m in the rightmost p slots, 0<=p<=n, 0<=m<=n, summed over p, a(n,m)= Sum_{k=0..n} binomial(k,m)*binomial(n-k,k-m), (see program line).A053538
Triangle: a(n,m) = ways to place p balls in n slots with m in the rightmost p slots, 0<=p<=n, 0<=m<=n, summed over p, a(n,m)= Sum_{k=0..n} binomial(k,m)*binomial(n-k,k-m), (see program line).
- a(n) = n*8^(n-1).A053539
a(n) = n*8^(n-1).
- a(n) = n*9^(n-1).A053540
a(n) = n*9^(n-1).
- a(n) = n*10^(n-1).A053541
a(n) = n*10^(n-1).
- Distance from n-th composite number (A002808) to next prime.A053542
Distance from n-th composite number (A002808) to next prime.
- Distance to closest prime in sequence of composites.A053543
Distance to closest prime in sequence of composites.
- A052999 / 18.A053544
A052999 / 18.
- Comparisons needed for Batcher's sorting algorithm applied to 2^n items.A053545
Comparisons needed for Batcher's sorting algorithm applied to 2^n items.
- Smallest prime containing a leading sequence of n ascending numbers.A053546
Smallest prime containing a leading sequence of n ascending numbers.
- Smallest prime starting with A000422(n).A053547
Smallest prime starting with A000422(n).
- Number of ternary Lyndon words of length n with trace 0 and subtrace 0 over GF(3).A053548
Number of ternary Lyndon words of length n with trace 0 and subtrace 0 over GF(3).
- Number of labeled rooted connected graphs.A053549
Number of labeled rooted connected graphs.
- Reversion of [1,2,12,152,3640,...] (A053549).A053550
Reversion of [1,2,12,152,3640,...] (A053549).
- REVEGF transform of [1,2,12,152,3640,...] (A053549).A053551
REVEGF transform of [1,2,12,152,3640,...] (A053549).
- E.g.f. is obtained by reversion of e.g.f. for A053549.A053552
E.g.f. is obtained by reversion of e.g.f. for A053549.
- Extreme points of set of n X n symmetric substochastic matrices.A053553
Extreme points of set of n X n symmetric substochastic matrices.
- Duplicate of A048172.A053554
Duplicate of A048172.
- Number of distinct parameter sets (v,k,lambda) for Abelian difference sets of order n = k-lambda with 1 <= lambda <= n-1.A053555
Number of distinct parameter sets (v,k,lambda) for Abelian difference sets of order n = k-lambda with 1 <= lambda <= n-1.
- Denominator of Sum_{k=0..n} (-1)^k/k!.A053556
Denominator of Sum_{k=0..n} (-1)^k/k!.
- Numerator of Sum_{k=0..n} (-1)^k/k!.A053557
Numerator of Sum_{k=0..n} (-1)^k/k!.
- Primes formed by concatenating n consecutive increasing numbers starting with a prime and ending with the next consecutive prime.A053558
Primes formed by concatenating n consecutive increasing numbers starting with a prime and ending with the next consecutive prime.
- Primes formed by concatenating n consecutive increasing numbers starting with a palindrome and ending with the next consecutive palindrome.A053559
Primes formed by concatenating n consecutive increasing numbers starting with a palindrome and ending with the next consecutive palindrome.
- Number of ternary Lyndon words of length n with trace 0 and subtrace 1 over GF(3).A053560
Number of ternary Lyndon words of length n with trace 0 and subtrace 1 over GF(3).