Sequences
392,541 sequences
- Number of 5-tuples (v1,v2,v3,v4,v5) of nonnegative integers less than n such that v1 <= v5, v2 <= v5, v2 <= v4 and v3 <= v4.A085461
Number of 5-tuples (v1,v2,v3,v4,v5) of nonnegative integers less than n such that v1 <= v5, v2 <= v5, v2 <= v4 and v3 <= v4.
- Number of 5-tuples (v1,v2,v3,v4,v5) of nonnegative integers less than n such that v1 <= v4, v1 <= v5, v2 <= v4 and v3 <= v4.A085462
Number of 5-tuples (v1,v2,v3,v4,v5) of nonnegative integers less than n such that v1 <= v4, v1 <= v5, v2 <= v4 and v3 <= v4.
- Number of 5-tuples (v1,v2,v3,v4,v5) of nonnegative integers less than n such that v1 <= v4, v1 <= v5, v2 <= v4, v2 <= v5 and v3 <= v4.A085463
Number of 5-tuples (v1,v2,v3,v4,v5) of nonnegative integers less than n such that v1 <= v4, v1 <= v5, v2 <= v4, v2 <= v5 and v3 <= v4.
- Number of monotone n-weightings of complete bipartite digraph K(4,2).A085464
Number of monotone n-weightings of complete bipartite digraph K(4,2).
- Number of monotone n-weightings of complete bipartite digraph K(3,3).A085465
Number of monotone n-weightings of complete bipartite digraph K(3,3).
- a(n) is the denominator of the polynomial in e^2 giving the (2n)th du Bois Reymond constant.A085466
a(n) is the denominator of the polynomial in e^2 giving the (2n)th du Bois Reymond constant.
- Numerators of coefficients of e^2 in the table of (2n)th du Bois Reymond constants.A085467
Numerators of coefficients of e^2 in the table of (2n)th du Bois Reymond constants.
- Odd numbers m such that there is at least one k dividing (m-1)!-1 (m <= k <= 2*m).A085468
Odd numbers m such that there is at least one k dividing (m-1)!-1 (m <= k <= 2*m).
- Decimal expansion of Madelung constant (negated) for NaCl structure.A085469
Decimal expansion of Madelung constant (negated) for NaCl structure.
- Triangle of coefficients of powers of e^2 in numerators of Sum_{k>=1} {1 / (1 + k^2*Pi^2)^n}.A085470
Triangle of coefficients of powers of e^2 in numerators of Sum_{k>=1} {1 / (1 + k^2*Pi^2)^n}.
- Triangle of coefficients of numerators of powers of e^2 in Sum_{k>=1} {1 / (1 + (k+1/2)^2*Pi^2)^n} + {4^n / (4+Pi^2)^n}.A085471
Triangle of coefficients of numerators of powers of e^2 in Sum_{k>=1} {1 / (1 + (k+1/2)^2*Pi^2)^n} + {4^n / (4+Pi^2)^n}.
- Duplicate of A054242.A085472
Duplicate of A054242.
- a(n) = 6*n^2 + 3*n + 1.A085473
a(n) = 6*n^2 + 3*n + 1.
- C(2*n+4,4)-C(2*n,4).A085474
C(2*n+4,4)-C(2*n,4).
- Square array of binomial related numbers, read by antidiagonals.A085475
Square array of binomial related numbers, read by antidiagonals.
- Periodic Pascal array, read by upward antidiagonals.A085476
Periodic Pascal array, read by upward antidiagonals.
- Numbers n such that there is at least one k dividing (n-1)!-1 (n<=k<=2n).A085477
Numbers n such that there is at least one k dividing (n-1)!-1 (n<=k<=2n).
- Triangle read by rows: T(n, k) = binomial(n + k, 2*k).A085478
Triangle read by rows: T(n, k) = binomial(n + k, 2*k).
- Product of three solutions of the Diophantine equation x^3 - y^3 = z^2.A085479
Product of three solutions of the Diophantine equation x^3 - y^3 = z^2.
- Expansion of 3*x*(1+2*x)/(1-3*x-3*x^2).A085480
Expansion of 3*x*(1+2*x)/(1-3*x-3*x^2).
- Duplicate of A030195.A085481
Duplicate of A030195.
- Product of three solutions of the Diophantine equation x^2 - y^2 = z^3.A085482
Product of three solutions of the Diophantine equation x^2 - y^2 = z^3.
- Triangle read by rows: S_B(n,k) = "Type B" Stirling numbers of the second kind.A085483
Triangle read by rows: S_B(n,k) = "Type B" Stirling numbers of the second kind.
- Symmetric square array, read by antidiagonals: T(k, k) = T(0, k + 1) = Sum_{m = 0..k} C(k, m)*T(m, k - m) for k >= 0; T(0, 0) = 1; T(n, k) = T(n - 1, k) + T(n, k - 1) for n, k >= 1.A085484
Symmetric square array, read by antidiagonals: T(k, k) = T(0, k + 1) = Sum_{m = 0..k} C(k, m)*T(m, k - m) for k >= 0; T(0, 0) = 1; T(n, k) = T(n - 1, k) + T(n, k - 1) for n, k >= 1.
- First row of symmetric square table A085484, in which the main diagonal is equal to the first row shift left.A085485
First row of symmetric square table A085484, in which the main diagonal is equal to the first row shift left.
- Antidiagonal sums of symmetric square table A085484, in which the main diagonal is equal to the first row shift left.A085486
Antidiagonal sums of symmetric square table A085484, in which the main diagonal is equal to the first row shift left.
- a(n) = p^n + q^n, p = (1 + sqrt(21))/2, q = (1 - sqrt(21))/2.A085487
a(n) = p^n + q^n, p = (1 + sqrt(21))/2, q = (1 - sqrt(21))/2.
- Duplicate of A072265.A085488
Duplicate of A072265.
- a(n) is the number of subsets of {1,...,n} containing no solutions to x+y=z with x and y distinct (one version of "sum-free subsets").A085489
a(n) is the number of subsets of {1,...,n} containing no solutions to x+y=z with x and y distinct (one version of "sum-free subsets").
- Number of pairs with two different elements which can be obtained by selecting unique elements from two sets with n+1 and n^2 elements respectively and n common elements.A085490
Number of pairs with two different elements which can be obtained by selecting unique elements from two sets with n+1 and n^2 elements respectively and n common elements.
- Number of ways to write n as sum of distinct divisors of n+1.A085491
Number of ways to write n as sum of distinct divisors of n+1.
- Numbers n having no partition into distinct divisors of n+1.A085492
Numbers n having no partition into distinct divisors of n+1.
- Numbers k having partitions into distinct divisors of k + 1.A085493
Numbers k having partitions into distinct divisors of k + 1.
- Numbers k having exactly one partition into distinct divisors of k+1.A085494
Numbers k having exactly one partition into distinct divisors of k+1.
- Maximal order of a finite subgroup of the group GL(n,Q).A085495
Maximal order of a finite subgroup of the group GL(n,Q).
- Number of ways to write prime(n) as sum of distinct divisors of prime(n)+1.A085496
Number of ways to write prime(n) as sum of distinct divisors of prime(n)+1.
- Primes p having no partition into distinct divisors of p+1.A085497
Primes p having no partition into distinct divisors of p+1.
- Primes p having at least one partition into distinct divisors of p + 1.A085498
Primes p having at least one partition into distinct divisors of p + 1.
- Primes p having exactly one partition into distinct divisors of p+1.A085499
Primes p having exactly one partition into distinct divisors of p+1.
- Indices of primes where nondecreasing gaps occur.A085500
Indices of primes where nondecreasing gaps occur.
- Number of prime powers p^k <= n that are not prime (k = 0 or k > 1).A085501
Number of prime powers p^k <= n that are not prime (k = 0 or k > 1).
- Number of (unordered) ways of making change for n dollars using coins of denominations 1, 5, 10, 25, 50 and 100.A085502
Number of (unordered) ways of making change for n dollars using coins of denominations 1, 5, 10, 25, 50 and 100.
- Sub-triangle of A008292: take every second term of every second row.A085503
Sub-triangle of A008292: take every second term of every second row.
- Horadam sequence (0,1,9,3).A085504
Horadam sequence (0,1,9,3).
- a(n) = ceiling(((1*n^0 + 1*n^1 + 2*n^2 + 4*n^3)/(1*n^0 + 2*n^1 + 1*n^2))^2).A085505
a(n) = ceiling(((1*n^0 + 1*n^1 + 2*n^2 + 4*n^3)/(1*n^0 + 2*n^1 + 1*n^2))^2).
- Number of {-1,0,1} n X n matrices that have (real and) positive eigenvalues.A085506
Number of {-1,0,1} n X n matrices that have (real and) positive eigenvalues.
- Stirling transform of the prime characteristic function.A085507
Stirling transform of the prime characteristic function.
- Decimal expansion of conjectured value for the Bloch constant.A085508
Decimal expansion of conjectured value for the Bloch constant.
- Numbers containing no zero digits in bases 3 to 10.A085509
Numbers containing no zero digits in bases 3 to 10.
- Permanent of the n X n matrix whose element (i,j) equals phi(|i-j|).A085510
Permanent of the n X n matrix whose element (i,j) equals phi(|i-j|).