Sequences
392,541 sequences
- Satisfies A^2 = BINOMIAL(A090358^3), where A090358^6 = BINOMIAL(A090358^5).A090361
Satisfies A^2 = BINOMIAL(A090358^3), where A090358^6 = BINOMIAL(A090358^5).
- G.f. satisfies A^6 = BINOMIAL(A)^5 and also equals A090358^5.A090362
G.f. satisfies A^6 = BINOMIAL(A)^5 and also equals A090358^5.
- Shifts 1 place left under the BINOMIAL transform of the self-convolution of this sequence.A090363
Shifts 1 place left under the BINOMIAL transform of the self-convolution of this sequence.
- Convolution of this sequence with its binomial transform equals the second iteration of the binomial transform upon this sequence.A090364
Convolution of this sequence with its binomial transform equals the second iteration of the binomial transform upon this sequence.
- Shifts 1 place left under the INVERT transform of the BINOMIAL transform of this sequence.A090365
Shifts 1 place left under the INVERT transform of the BINOMIAL transform of this sequence.
- Shifts 1 place left under the INVERT transform of the BINOMIAL transform of the self-convolution of this sequence.A090366
Shifts 1 place left under the INVERT transform of the BINOMIAL transform of the self-convolution of this sequence.
- Shifts 1 place left under the INVERT transform of the BINOMIAL transform of the self-convolution cube of this sequence.A090367
Shifts 1 place left under the INVERT transform of the BINOMIAL transform of the self-convolution cube of this sequence.
- a(1) = 1; for n > 1, smallest divisor > 1 of 2n-1.A090368
a(1) = 1; for n > 1, smallest divisor > 1 of 2n-1.
- Smallest divisor of 2n that is > 2, or 0 if no such divisor exists.A090369
Smallest divisor of 2n that is > 2, or 0 if no such divisor exists.
- Least m > 3 such that gcd(n-1, m*n - 1) = m-1.A090370
Least m > 3 such that gcd(n-1, m*n - 1) = m-1.
- Number of unrooted planar 2-constellations with n digons. Also number of n-edge unrooted planar Eulerian maps with bicolored faces.A090371
Number of unrooted planar 2-constellations with n digons. Also number of n-edge unrooted planar Eulerian maps with bicolored faces.
- Number of unrooted planar 3-constellations with n triangles.A090372
Number of unrooted planar 3-constellations with n triangles.
- Number of unrooted planar 4-constellations with n quadrangles.A090373
Number of unrooted planar 4-constellations with n quadrangles.
- Number of rooted planar 4-constellations with n quadrangles: rooted planar maps with bicolored faces having n black quadrangular faces and an arbitrary number of white faces of degrees multiple to 4.A090374
Number of rooted planar 4-constellations with n quadrangles: rooted planar maps with bicolored faces having n black quadrangular faces and an arbitrary number of white faces of degrees multiple to 4.
- Number of unrooted Eulerian maps with bicolored faces which are self-isomorphic under reversing the colors.A090375
Number of unrooted Eulerian maps with bicolored faces which are self-isomorphic under reversing the colors.
- Number of rooted generalized quadrangular dissections of weight n of a closed disk: planar maps having the external face bounded by a polygon and all internal faces of size 4.A090376
Number of rooted generalized quadrangular dissections of weight n of a closed disk: planar maps having the external face bounded by a polygon and all internal faces of size 4.
- Number of configurations that require a minimum of n moves to be reached, starting with the empty square in one of the corners of an infinitely large extension of Sam Loyd's sliding block 15-puzzle.A090377
Number of configurations that require a minimum of n moves to be reached, starting with the empty square in one of the corners of an infinitely large extension of Sam Loyd's sliding block 15-puzzle.
- Number of configurations that require a minimum of n moves to be reached, starting with the empty square at mid-side of a boundary of an infinitely large extension of Sam Loyd's sliding block 15-puzzle.A090378
Number of configurations that require a minimum of n moves to be reached, starting with the empty square at mid-side of a boundary of an infinitely large extension of Sam Loyd's sliding block 15-puzzle.
- a(n) = abs(floor((pi(n)-2)/(2-pi(n)+pi(n-1)))), where pi(n) is A000720(n).A090379
a(n) = abs(floor((pi(n)-2)/(2-pi(n)+pi(n-1)))), where pi(n) is A000720(n).
- Number of iterations used by a 2D cutting stock problem related algorithm.A090380
Number of iterations used by a 2D cutting stock problem related algorithm.
- Expansion of (1+4x+7x^2)/((1-x)^2*(1-x^2)).A090381
Expansion of (1+4x+7x^2)/((1-x)^2*(1-x^2)).
- Number of minimal generators for toric ideal associated with path with n nodes.A090382
Number of minimal generators for toric ideal associated with path with n nodes.
- Minimal number of vertices of polytope P_T associated with any binary tree having 2n+1 nodes.A090383
Minimal number of vertices of polytope P_T associated with any binary tree having 2n+1 nodes.
- Maximal number of vertices of polytope P_T associated with any binary tree having 2n+1 nodes.A090384
Maximal number of vertices of polytope P_T associated with any binary tree having 2n+1 nodes.
- Maximal number of vertices of polytope P_T associated with any tree having n nodes.A090385
Maximal number of vertices of polytope P_T associated with any tree having n nodes.
- Fifth diagonal (m=4) of triangle A084938; a(n) = A084938(n+4,n) = (n^4 + 18*n^3 + 131*n^2 + 426*n)/24.A090386
Fifth diagonal (m=4) of triangle A084938; a(n) = A084938(n+4,n) = (n^4 + 18*n^3 + 131*n^2 + 426*n)/24.
- Numerator of d(n)/n, where d(n) (A000005) is the number of divisors of n.A090387
Numerator of d(n)/n, where d(n) (A000005) is the number of divisors of n.
- Decimal expansion of 1 + sqrt(3).A090388
Decimal expansion of 1 + sqrt(3).
- Duplicate of A061238.A090389
Duplicate of A061238.
- Repeatedly multiply (1,0,0) by ([1,2,2],[2,1,2],[2,2,3]); sequence gives leading entry.A090390
Repeatedly multiply (1,0,0) by ([1,2,2],[2,1,2],[2,2,3]); sequence gives leading entry.
- a(n) = n*(n^4 + 30*n^3 + 395*n^2 + 2910*n + 11064)/120.A090391
a(n) = n*(n^4 + 30*n^3 + 395*n^2 + 2910*n + 11064)/120.
- Seventh diagonal (m=6) of triangle A084938; a(n) = A084938(n+6,n) = (n^6 + 45*n^5 + 925*n^4 + 11475*n^3 + 92314*n^2 + 413640*n)/720.A090392
Seventh diagonal (m=6) of triangle A084938; a(n) = A084938(n+6,n) = (n^6 + 45*n^5 + 925*n^4 + 11475*n^3 + 92314*n^2 + 413640*n)/720.
- Eighth diagonal (m=7) of triangle A084938; a(n) = A084938(n+7,n) = (n^7 + 63*n^6 + 1855*n^5 + 34125*n^4 + 438424*n^3 + 3980172*n^2 + 20946960*n)/5040.A090393
Eighth diagonal (m=7) of triangle A084938; a(n) = A084938(n+7,n) = (n^7 + 63*n^6 + 1855*n^5 + 34125*n^4 + 438424*n^3 + 3980172*n^2 + 20946960*n)/5040.
- Ninth diagonal (m=8) of triangle A084938; a(n) = A084938(n+8,n) = (n^8 + 84*n^7 + 3346*n^6 + 84840*n^5 + 1550689*n^4 + 21632436*n^3 + 224782284*n^2 + 1377648720*n)/40320.A090394
Ninth diagonal (m=8) of triangle A084938; a(n) = A084938(n+8,n) = (n^8 + 84*n^7 + 3346*n^6 + 84840*n^5 + 1550689*n^4 + 21632436*n^3 + 224782284*n^2 + 1377648720*n)/40320.
- Denominator of d(n)/n, where d(n) is the number of divisors of n (A000005).A090395
Denominator of d(n)/n, where d(n) is the number of divisors of n (A000005).
- Remainder when the sum of the first n primes is divided by n.A090396
Remainder when the sum of the first n primes is divided by n.
- Number of terms in simple continued fraction for (3/2)^n.A090397
Number of terms in simple continued fraction for (3/2)^n.
- a(n) = Floor[(2*Pi/E)*n^2].A090398
a(n) = Floor[(2*Pi/E)*n^2].
- Expansion of 1/(1-2x+2x^4).A090399
Expansion of 1/(1-2x+2x^4).
- Expansion of 1/(1-3x+3x^3) in powers of x.A090400
Expansion of 1/(1-3x+3x^3) in powers of x.
- Expansion of 1/(1-3x+3x^4).A090401
Expansion of 1/(1-3x+3x^4).
- Symmetric triangle, read by rows, where the terms in each row, after being divided by their corresponding binomial coefficients, have an integer sum.A090402
Symmetric triangle, read by rows, where the terms in each row, after being divided by their corresponding binomial coefficients, have an integer sum.
- Balanced primes: Primes which are both the arithmetic mean and median of a sequence of 2k+1 consecutive primes, for some k>0.A090403
Balanced primes: Primes which are both the arithmetic mean and median of a sequence of 2k+1 consecutive primes, for some k>0.
- Triangle read by rows in which the n-th row contains the n smallest numbers that are the product of n numbers > 1.A090404
Triangle read by rows in which the n-th row contains the n smallest numbers that are the product of n numbers > 1.
- a(n) = PrimePi(n+2) - PrimePi(n).A090405
a(n) = PrimePi(n+2) - PrimePi(n).
- a(n) = PrimePi(n+3) - PrimePi(n).A090406
a(n) = PrimePi(n+3) - PrimePi(n).
- a(n) = Sum_{k = 0..n} C(4*n + 1, 4*k).A090407
a(n) = Sum_{k = 0..n} C(4*n + 1, 4*k).
- a(n) = Sum_{k=0..n} binomial(4n+3,4k).A090408
a(n) = Sum_{k=0..n} binomial(4n+3,4k).
- a(n) = (7*8^n + 2*(-1)^n)/9.A090409
a(n) = (7*8^n + 2*(-1)^n)/9.
- Values of L(10^n), where L(n) is the summatory function of the Liouville function A008836(n).A090410
Values of L(10^n), where L(n) is the summatory function of the Liouville function A008836(n).