Sequences
392,541 sequences
- Number of self-complementary 2-multigraphs with loops on n nodes.A052111
Number of self-complementary 2-multigraphs with loops on n nodes.
- Number of self-complementary directed 2-multigraphs on n nodes.A052112
Number of self-complementary directed 2-multigraphs on n nodes.
- Number of self-complementary directed 2-multigraphs with loops on n nodes.A052113
Number of self-complementary directed 2-multigraphs with loops on n nodes.
- Number of self-complementary directed 4-multigraphs with loops on n nodes.A052114
Number of self-complementary directed 4-multigraphs with loops on n nodes.
- Number of nonnegative integer pairs (i,j) with binomial(i+r,r) + binomial(j+r,r) <= binomial(n+r,r), r=2.A052115
Number of nonnegative integer pairs (i,j) with binomial(i+r,r) + binomial(j+r,r) <= binomial(n+r,r), r=2.
- Number of nonnegative integer pairs (i,j) with binomial(i+r,r) + binomial(j+r,r) <= binomial(n+r,r), r=3.A052116
Number of nonnegative integer pairs (i,j) with binomial(i+r,r) + binomial(j+r,r) <= binomial(n+r,r), r=3.
- Number of nonnegative integer pairs (i,j) with binomial(i+r,r) + binomial(j+r,r) <= binomial(n+r,r), r=4.A052117
Number of nonnegative integer pairs (i,j) with binomial(i+r,r) + binomial(j+r,r) <= binomial(n+r,r), r=4.
- Number of nonnegative integer pairs (i,j) with binomial(i+r,r) + binomial(j+r,r) <= binomial(n+r,r), r=5.A052118
Number of nonnegative integer pairs (i,j) with binomial(i+r,r) + binomial(j+r,r) <= binomial(n+r,r), r=5.
- Decimal expansion of number with continued fraction expansion 0, 1, 2, 3, 4, 5, 6, ...A052119
Decimal expansion of number with continued fraction expansion 0, 1, 2, 3, 4, 5, 6, ...
- Number of 3-valent trees (= boron trees or binary trees) with n nodes.A052120
Number of 3-valent trees (= boron trees or binary trees) with n nodes.
- Triangle of coefficients of polynomials enumerating trees with n labeled nodes by inversions.A052121
Triangle of coefficients of polynomials enumerating trees with n labeled nodes by inversions.
- Numerators of coefficients in the e.g.f. a(x) such that a(a(x)) = exp(x) - 1.A052122
Numerators of coefficients in the e.g.f. a(x) such that a(a(x)) = exp(x) - 1.
- Log_2 of denominators of coefficients in the e.g.f. a(x) such that a(a(x)) = exp(x) - 1.A052123
Log_2 of denominators of coefficients in the e.g.f. a(x) such that a(a(x)) = exp(x) - 1.
- Expansion of e.g.f. exp(-2*x)/(1-x)^3.A052124
Expansion of e.g.f. exp(-2*x)/(1-x)^3.
- a(n) = n/A034684(n).A052125
a(n) = n/A034684(n).
- a(1) = 1; for n>1, a(n)=n/(largest prime dividing n).A052126
a(1) = 1; for n>1, a(n)=n/(largest prime dividing n).
- Sum_{n >= 0} a(n) * x^n / n!^2 = exp(-2*x)/(1-x)^3.A052127
Sum_{n >= 0} a(n) * x^n / n!^2 = exp(-2*x)/(1-x)^3.
- a(1) = 1; for n > 1, a(n) is the largest divisor of n that is coprime to a larger divisor of n.A052128
a(1) = 1; for n > 1, a(n) is the largest divisor of n that is coprime to a larger divisor of n.
- a(0) = 1; thereafter a(n) = n*a(n-1)^2.A052129
a(0) = 1; thereafter a(n) = n*a(n-1)^2.
- a(n) is the number of numbers between 1 and 2^m with m-n prime factors (counted with multiplicity), for m sufficiently large.A052130
a(n) is the number of numbers between 1 and 2^m with m-n prime factors (counted with multiplicity), for m sufficiently large.
- Decimal expansion of conjectured limit of ratio of successive terms of A052109.A052131
Decimal expansion of conjectured limit of ratio of successive terms of A052109.
- Numerators of coefficients in function a(x) such that a(a(a(x))) = sin x.A052132
Numerators of coefficients in function a(x) such that a(a(a(x))) = sin x.
- CONTINUANT transform of 0, 1, 1, 2, 1, 3, 2, 3, ... (A002487).A052133
CONTINUANT transform of 0, 1, 1, 2, 1, 3, 2, 3, ... (A002487).
- Numerators of coefficients in function a(x) such that a(a(a(x))) = sinh x.A052134
Numerators of coefficients in function a(x) such that a(a(a(x))) = sinh x.
- Denominators of coefficients in function a(x) such that a(a(a(x))) = sin x.A052135
Denominators of coefficients in function a(x) such that a(a(a(x))) = sin x.
- Numerators of power series coefficients of a(x) satisfying a(a(a(x)))= arctan(x).A052136
Numerators of power series coefficients of a(x) satisfying a(a(a(x)))= arctan(x).
- Denominators of power series coefficients of a(x) satisfying a(a(a(x)))= arctan(x).A052137
Denominators of power series coefficients of a(x) satisfying a(a(a(x)))= arctan(x).
- Numerators of coefficients in function a(x) such that a(a(a(x))) = log (1+x).A052138
Numerators of coefficients in function a(x) such that a(a(a(x))) = log (1+x).
- Denominators of coefficients in function a(x) such that a(a(a(x))) = log (1+x).A052139
Denominators of coefficients in function a(x) such that a(a(a(x))) = log (1+x).
- a(n) = 4^n * n!^2 * Sum_{k=0..n} 1/k!.A052140
a(n) = 4^n * n!^2 * Sum_{k=0..n} 1/k!.
- Number of paths from (0,0) to (n,n) that always move closer to (n,n) (and do not pass (n,n) and backtrack).A052141
Number of paths from (0,0) to (n,n) that always move closer to (n,n) (and do not pass (n,n) and backtrack).
- Expansion of e.g.f. exp(x/(1-4*x)^(1/2)).A052142
Expansion of e.g.f. exp(x/(1-4*x)^(1/2)).
- E.g.f.: exp(x)/sqrt(1-4*x).A052143
E.g.f.: exp(x)/sqrt(1-4*x).
- a(n) = A000172(n)^2.A052144
a(n) = A000172(n)^2.
- a(n) = (2n-1)*(2n-1)!/n.A052145
a(n) = (2n-1)*(2n-1)!/n.
- a(n) = floor((sqrt(1+8*n)-3)/2).A052146
a(n) = floor((sqrt(1+8*n)-3)/2).
- a(n) = prime(n) + 2.A052147
a(n) = prime(n) + 2.
- Integers k < (reversal of k) such that (reversal of k) + 1 is divisible by k-1.A052148
Integers k < (reversal of k) such that (reversal of k) + 1 is divisible by k-1.
- Number of nonsquare rectangles on an n X n board.A052149
Number of nonsquare rectangles on an n X n board.
- Partial sums of A000340, second partial sums of A003462.A052150
Partial sums of A000340, second partial sums of A003462.
- Number of self-complementary directed 3-multigraphs on n nodes.A052151
Number of self-complementary directed 3-multigraphs on n nodes.
- Number of self-complementary directed 3-multigraphs with loops on 2n nodes.A052152
Number of self-complementary directed 3-multigraphs with loops on 2n nodes.
- Rhombi (in 3 different orientations) in a rhombus with 60-degree acute angles.A052153
Rhombi (in 3 different orientations) in a rhombus with 60-degree acute angles.
- Array read by antidiagonals: a(n,k)= coefficient of z^n of p_k(z), where p_k+1(z)=(p_k(z))^2+z, p_1(z)=z.A052154
Array read by antidiagonals: a(n,k)= coefficient of z^n of p_k(z), where p_k+1(z)=(p_k(z))^2+z, p_1(z)=z.
- Pseudoprimes to both base 2 and base 3, i.e., intersection of A001567 and A005935.A052155
Pseudoprimes to both base 2 and base 3, i.e., intersection of A001567 and A005935.
- Number of compositions of n into 2*j-1 kinds of j's for all j>=1.A052156
Number of compositions of n into 2*j-1 kinds of j's for all j>=1.
- Least positive integer r such that there exists an integer s, 0 <= s < r gcd(r-i, s-j) > 1 for all integers i, j with 0 <= i, j < n.A052157
Least positive integer r such that there exists an integer s, 0 <= s < r gcd(r-i, s-j) > 1 for all integers i, j with 0 <= i, j < n.
- Lower prime of a difference of 6 (G-minor-6 primes) between consecutive primes of 6k+1 form.A052158
Lower prime of a difference of 6 (G-minor-6 primes) between consecutive primes of 6k+1 form.
- Lower prime of a difference of 6 (G-minor-6 primes) between consecutive primes of 6k+5 form.A052159
Lower prime of a difference of 6 (G-minor-6 primes) between consecutive primes of 6k+5 form.
- Isolated prime difference equals 6: primes prime(k) such that d(k) = prime(k+1) - prime(k) = 6 but neither d(k+1) nor d(k-1) is 6.A052160
Isolated prime difference equals 6: primes prime(k) such that d(k) = prime(k+1) - prime(k) = 6 but neither d(k+1) nor d(k-1) is 6.