Sequences
392,541 sequences
- Number of n X n X n 3-D matrices over symbol set {1,...,n} equivalent under any permutation of rows, columns, stacks or the symbol set.A091511
Number of n X n X n 3-D matrices over symbol set {1,...,n} equivalent under any permutation of rows, columns, stacks or the symbol set.
- a(n) is the largest integer m such that 2^m divides (2*n)^n, i.e., the exponent of 2 in (2*n)^n.A091512
a(n) is the largest integer m such that 2^m divides (2*n)^n, i.e., the exponent of 2 in (2*n)^n.
- Numbers k such that (2^k + 1)^2 - 2 = 4^k + 2^(k+1) - 1 is prime.A091513
Numbers k such that (2^k + 1)^2 - 2 = 4^k + 2^(k+1) - 1 is prime.
- Primes of the form (2^n + 1)^2 - 2 = 4^n + 2^(n+1) - 1.A091514
Primes of the form (2^n + 1)^2 - 2 = 4^n + 2^(n+1) - 1.
- Numbers k such that (2^k - 1)^2 - 2 = 4^k - 2^(k+1) - 1 is prime.A091515
Numbers k such that (2^k - 1)^2 - 2 = 4^k - 2^(k+1) - 1 is prime.
- Primes of the form 4^k - 2^(k+1) - 1.A091516
Primes of the form 4^k - 2^(k+1) - 1.
- Decimal expansion of the value of r corresponding to the onset of the period 16-cycle in the logistic map.A091517
Decimal expansion of the value of r corresponding to the onset of the period 16-cycle in the logistic map.
- Decimal expansion of the hyperbolic volume of the figure eight knot complement.A091518
Decimal expansion of the hyperbolic volume of the figure eight knot complement.
- G.f.: Sum_{k>=0} (2^k*t*(1+t)/(1-t)^3, t=x^2^k).A091519
G.f.: Sum_{k>=0} (2^k*t*(1+t)/(1-t)^3, t=x^2^k).
- Expansion of 1 / ((1 - 4*x) * sqrt(1 + 4*x)) in powers of x.A091520
Expansion of 1 / ((1 - 4*x) * sqrt(1 + 4*x)) in powers of x.
- Number of configurations of a variant of the 3-dimensional 3 X 3 X 3 sliding cube puzzle that require a minimum of n moves to be reached, starting with the empty space at the center of one of the 6 faces of the combination cube.A091521
Number of configurations of a variant of the 3-dimensional 3 X 3 X 3 sliding cube puzzle that require a minimum of n moves to be reached, starting with the empty space at the center of one of the 6 faces of the combination cube.
- Graham-Pollak sequence with initial term 5.A091522
Graham-Pollak sequence with initial term 5.
- Graham-Pollak sequence with initial term 8.A091523
Graham-Pollak sequence with initial term 8.
- a(m) is the multiplier of sqrt(2) in the constant alpha(m) = a(m)*sqrt(2) - b(m), where alpha(m) is the value of the constant determined by the binary bits in the recurrence associated with the Graham-Pollak sequence.A091524
a(m) is the multiplier of sqrt(2) in the constant alpha(m) = a(m)*sqrt(2) - b(m), where alpha(m) is the value of the constant determined by the binary bits in the recurrence associated with the Graham-Pollak sequence.
- Duplicate of A091524.A091525
Duplicate of A091524.
- Coefficient of x^n in 1/((1+x)*(1-x)^(n-1)).A091526
Coefficient of x^n in 1/((1+x)*(1-x)^(n-1)).
- a(n) = ((3*n)!/n!^2)*(Gamma(1+n/2)/Gamma(1+3n/2)).A091527
a(n) = ((3*n)!/n!^2)*(Gamma(1+n/2)/Gamma(1+3n/2)).
- a(n) = (Sum_{k=1..n} H(k)*k!*(n-k)!) mod (n+1), where H(k) is the k-th harmonic number.A091528
a(n) = (Sum_{k=1..n} H(k)*k!*(n-k)!) mod (n+1), where H(k) is the k-th harmonic number.
- When sum {k=1 to n} H(k) k! (n-k)! (mod {n+1}) (A091528) is not zero.A091529
When sum {k=1 to n} H(k) k! (n-k)! (mod {n+1}) (A091528) is not zero.
- a(n) = Sum_{k=1..n} H(k) k! (n-k)!, where H(k) is the k-th harmonic number.A091530
a(n) = Sum_{k=1..n} H(k) k! (n-k)!, where H(k) is the k-th harmonic number.
- Primes p such that k = 2p is the smallest positive solution to the equation phi(p+k) = phi(p) + phi(k), where phi is Euler's totient function.A091531
Primes p such that k = 2p is the smallest positive solution to the equation phi(p+k) = phi(p) + phi(k), where phi is Euler's totient function.
- Where the number of terms in simple continued fraction for H(j) exceeds all H(i), j>i and H(k) is the k-th harmonic number.A091532
Where the number of terms in simple continued fraction for H(j) exceeds all H(i), j>i and H(k) is the k-th harmonic number.
- Triangle read by rows, related to Pascal's triangle, starting with rows 1; 1,1.A091533
Triangle read by rows, related to Pascal's triangle, starting with rows 1; 1,1.
- Generalized Stirling2 array (5,2).A091534
Generalized Stirling2 array (5,2).
- First column (k=2) of array A091534 ((5,2)-Stirling2).A091535
First column (k=2) of array A091534 ((5,2)-Stirling2).
- Weight distribution of [89,45,17] binary quadratic-residue (or QR) code.A091536
Weight distribution of [89,45,17] binary quadratic-residue (or QR) code.
- Alternating row sums of array A091534 (generalized Stirling2 array (5,2)).A091537
Alternating row sums of array A091534 (generalized Stirling2 array (5,2)).
- Triangle built from m-primes as columns.A091538
Triangle built from m-primes as columns.
- Second column (k=3) of array A091534 ((5,2)-Stirling2) divided by 10.A091539
Second column (k=3) of array A091534 ((5,2)-Stirling2) divided by 10.
- Rescaled second column A091539 of array A091534 ((5,2)-Stirling2).A091540
Rescaled second column A091539 of array A091534 ((5,2)-Stirling2).
- Four times triple factorials (3*n-2)!!! with leading 1 added.A091541
Four times triple factorials (3*n-2)!!! with leading 1 added.
- a(n) = floor( |n * sin(n)| ), where n is in radians.A091542
a(n) = floor( |n * sin(n)| ), where n is in radians.
- Triangle built from first column sequences of generalized Stirling2 arrays (m+2,2)-Stirling2, m >= 0.A091543
Triangle built from first column sequences of generalized Stirling2 arrays (m+2,2)-Stirling2, m >= 0.
- First column sequence of array A091746 ((6,2)-Stirling2).A091544
First column sequence of array A091746 ((6,2)-Stirling2).
- First column sequence of the array (7,2)-Stirling2 A091747.A091545
First column sequence of the array (7,2)-Stirling2 A091747.
- First column of the array A092077 ((8,2)-Stirling2).A091546
First column of the array A092077 ((8,2)-Stirling2).
- Row sums of triangle A091543.A091547
Row sums of triangle A091543.
- Alternating row sums of triangle A091543.A091548
Alternating row sums of triangle A091543.
- Second column (k=3) sequence of array A078740 ((3,2)-Stirling2) divided by 6.A091549
Second column (k=3) sequence of array A078740 ((3,2)-Stirling2) divided by 6.
- Second column (k=3) sequence of array A091746 ((6,2)-Stirling2) divided by 12.A091550
Second column (k=3) sequence of array A091746 ((6,2)-Stirling2) divided by 12.
- Second column (k=3) sequence of array ((7,2)-Stirling2) divided by 14.A091551
Second column (k=3) sequence of array ((7,2)-Stirling2) divided by 14.
- Second column (k=3) sequence of array A092077 ((8,2)-Stirling2) divided by 16.A091552
Second column (k=3) sequence of array A092077 ((8,2)-Stirling2) divided by 16.
- Third column (k=6) sequence of array A090214 ((4,4)-Stirling2) divided by 72.A091553
Third column (k=6) sequence of array A090214 ((4,4)-Stirling2) divided by 72.
- Primes p such that k = 2p is the smallest positive solution to the equation sigma(p+k) = sigma(p) + sigma(k).A091554
Primes p such that k = 2p is the smallest positive solution to the equation sigma(p+k) = sigma(p) + sigma(k).
- Partial sums of Mertens's function (A002321).A091555
Partial sums of Mertens's function (A002321).
- Decimal expansion of 1/(1-Gamma).A091556
Decimal expansion of 1/(1-Gamma).
- Decimal expansion of zeta(Gamma) (negated).A091557
Decimal expansion of zeta(Gamma) (negated).
- Decimal expansion of zeta(Gamma^2).A091558
Decimal expansion of zeta(Gamma^2).
- Decimal expansion of zeta(1/(1-Gamma)).A091559
Decimal expansion of zeta(1/(1-Gamma)).
- Fractional part of e^a(n) is the largest yet.A091560
Fractional part of e^a(n) is the largest yet.