Sequences
392,541 sequences
- Hyperbinomial transform of A088957. Also the row sums of triangle A089460, which lists the coefficients for the second hyperbinomial transform.A089461
Hyperbinomial transform of A088957. Also the row sums of triangle A089460, which lists the coefficients for the second hyperbinomial transform.
- 2nd hyperbinomial transform of A001858.A089462
2nd hyperbinomial transform of A001858.
- Triangle, read by rows, of coefficients for the third iteration of the hyperbinomial transform.A089463
Triangle, read by rows, of coefficients for the third iteration of the hyperbinomial transform.
- Hyperbinomial transform of A089461. Also the row sums of triangle A089463, which lists the coefficients for the third hyperbinomial transform.A089464
Hyperbinomial transform of A089461. Also the row sums of triangle A089463, which lists the coefficients for the third hyperbinomial transform.
- 3rd hyperbinomial transform of A001858; also the hyperbinomial transform of A089462.A089465
3rd hyperbinomial transform of A001858; also the hyperbinomial transform of A089462.
- Inverse hyperbinomial transform of A089467.A089466
Inverse hyperbinomial transform of A089467.
- Hyperbinomial transform of A089466 and also the inverse hyperbinomial transform of A089468.A089467
Hyperbinomial transform of A089466 and also the inverse hyperbinomial transform of A089468.
- Hyperbinomial transform of A089467 and also the 2nd hyperbinomial transform of A089466.A089468
Hyperbinomial transform of A089467 and also the 2nd hyperbinomial transform of A089466.
- a(n+1) = the n-th term of the n-th binomial transform.A089469
a(n+1) = the n-th term of the n-th binomial transform.
- Self-convolution of this sequence is equal to its hyperbinomial transform and results in A089471.A089470
Self-convolution of this sequence is equal to its hyperbinomial transform and results in A089471.
- Equals the self-convolution of A089470 and also the hyperbinomial transform of A089470.A089471
Equals the self-convolution of A089470 and also the hyperbinomial transform of A089470.
- Number of different values taken by the determinant of a real (0,1)-matrix of order n.A089472
Number of different values taken by the determinant of a real (0,1)-matrix of order n.
- Number of configurations of the sliding block 8-puzzle that require a minimum of n moves to be reached, starting with the empty square in one of the corners.A089473
Number of configurations of the sliding block 8-puzzle that require a minimum of n moves to be reached, starting with the empty square in one of the corners.
- Number of configurations of the sliding block 8-puzzle that require a minimum of n moves to be reached, starting with the empty square in the center.A089474
Number of configurations of the sliding block 8-puzzle that require a minimum of n moves to be reached, starting with the empty square in the center.
- Number of different values taken by the permanent of a real nonsingular (0,1)-matrix of order n.A089475
Number of different values taken by the permanent of a real nonsingular (0,1)-matrix of order n.
- Number of different values taken by the permanent of a real singular (0,1)-matrix of order n.A089476
Number of different values taken by the permanent of a real singular (0,1)-matrix of order n.
- Smallest positive integer not the permanent of a real {0,1}-matrix of order n.A089477
Smallest positive integer not the permanent of a real {0,1}-matrix of order n.
- Triangle T(n,k) read by rows, where T(n,k) = number of times the determinant of a real n X n (0,1)-matrix takes the value k, for n >= 0, 0 <= k <= A003432(n).A089478
Triangle T(n,k) read by rows, where T(n,k) = number of times the determinant of a real n X n (0,1)-matrix takes the value k, for n >= 0, 0 <= k <= A003432(n).
- Triangle T(n,k) read by rows, where T(n,k) = number of times the permanent of a real n X n (0,1)-matrix takes the value k, for n >= 0, 0 <= k <= n!.A089479
Triangle T(n,k) read by rows, where T(n,k) = number of times the permanent of a real n X n (0,1)-matrix takes the value k, for n >= 0, 0 <= k <= n!.
- Triangle T(n,k) read by rows, where T(n,k) = number of times the permanent of a real nonsingular n X n (0,1)-matrix takes the value k, for n >= 1, 1 <= k <= A000255(n).A089480
Triangle T(n,k) read by rows, where T(n,k) = number of times the permanent of a real nonsingular n X n (0,1)-matrix takes the value k, for n >= 1, 1 <= k <= A000255(n).
- Triangle T(n,k) read by rows, where T(n,k) = number of times the permanent of a real singular n X n (0,1)-matrix takes the value k, for n >= 2, 0 <= k <= n!.A089481
Triangle T(n,k) read by rows, where T(n,k) = number of times the permanent of a real singular n X n (0,1)-matrix takes the value k, for n >= 2, 0 <= k <= n!.
- Number of real {0,1}-matrices having permanent = 1.A089482
Number of real {0,1}-matrices having permanent = 1.
- Number of configurations of the sliding block 8-puzzle that require a minimum of n moves to be reached, starting with the empty square at mid-side.A089483
Number of configurations of the sliding block 8-puzzle that require a minimum of n moves to be reached, starting with the empty square at mid-side.
- Number of positions of the 15-puzzle at a distance of n moves from an initial state with the empty square in one of the corners, in the single-tile metric.A089484
Number of positions of the 15-puzzle at a distance of n moves from an initial state with the empty square in one of the corners, in the single-tile metric.
- Numbers k such that k^4 + 4^k = A001589(k) is a semiprime.A089485
Numbers k such that k^4 + 4^k = A001589(k) is a semiprime.
- The second-smallest prime of the form (p-prime(n))/(prime(n)-1), where p is also prime.A089486
The second-smallest prime of the form (p-prime(n))/(prime(n)-1), where p is also prime.
- The third-smallest prime of the form (p-prime(n))/(prime(n)-1), where p is also prime.A089487
The third-smallest prime of the form (p-prime(n))/(prime(n)-1), where p is also prime.
- First occurrence where (p-q)/(q-3), p and q are primes.A089488
First occurrence where (p-q)/(q-3), p and q are primes.
- Smallest k greater than n such that (k^2-n^2, 2*k*n, k^2+n^2) is a primitive Pythagorean triple and the corresponding right triangle has a prime hypotenuse.A089489
Smallest k greater than n such that (k^2-n^2, 2*k*n, k^2+n^2) is a primitive Pythagorean triple and the corresponding right triangle has a prime hypotenuse.
- Third occurrence where (p-q)/(q-3), p and q are primes.A089490
Third occurrence where (p-q)/(q-3), p and q are primes.
- Decimal expansion of Buffon's constant 3/Pi.A089491
Decimal expansion of Buffon's constant 3/Pi.
- Sequence of primes 2*p(k) + 3 such that 2*p(k) + 3, 2*p(k+1) + 3, 2*p(k+2) + 3, 2*p(k+3) + 3 are consecutive primes, where p(i) denotes the i-th prime.A089492
Sequence of primes 2*p(k) + 3 such that 2*p(k) + 3, 2*p(k+1) + 3, 2*p(k+2) + 3, 2*p(k+3) + 3 are consecutive primes, where p(i) denotes the i-th prime.
- a(n) = smallest k such that the Reverse and Add! trajectory of A063048(n) joins the trajectory of k.A089493
a(n) = smallest k such that the Reverse and Add! trajectory of A063048(n) joins the trajectory of k.
- a(n) = smallest non-palindromic k such that the Reverse and Add! trajectory of k is palindrome-free and joins the trajectory of A070788(n).A089494
a(n) = smallest non-palindromic k such that the Reverse and Add! trajectory of k is palindrome-free and joins the trajectory of A070788(n).
- a(n) = mu(prime(n)+1), where mu is the Moebius function.A089495
a(n) = mu(prime(n)+1), where mu is the Moebius function.
- a(n) = mu(prime(n)+1) + mu(prime(n)-1), where mu is the Moebius function.A089496
a(n) = mu(prime(n)+1) + mu(prime(n)-1), where mu is the Moebius function.
- mu(prime(n)+1) - mu(prime(n)-1), where mu is the Moebius function.A089497
mu(prime(n)+1) - mu(prime(n)-1), where mu is the Moebius function.
- Duplicate of A046729.A089498
Duplicate of A046729.
- a(0)=0; a(1)=1; a(2n) = 4*Sum_{k=0..n} a(2k-1); a(2n+1) = a(2n) + a(2n-1).A089499
a(0)=0; a(1)=1; a(2n) = 4*Sum_{k=0..n} a(2k-1); a(2n+1) = a(2n) + a(2n-1).
- Denominators for computation of column sequences of triangle A071951 (Legendre-Stirling).A089500
Denominators for computation of column sequences of triangle A071951 (Legendre-Stirling).
- Built from superfactorials A000178.A089501
Built from superfactorials A000178.
- Fifth occurrence where (p-q)/(q-5), p and q are primes.A089502
Fifth occurrence where (p-q)/(q-5), p and q are primes.
- Triangle of numbers used for basis change between certain falling factorials.A089503
Triangle of numbers used for basis change between certain falling factorials.
- A generalization of triangle A071951 (Legendre-Stirling).A089504
A generalization of triangle A071951 (Legendre-Stirling).
- Triangle of signed numbers used for the computation of the column sequences of triangle A089504.A089505
Triangle of signed numbers used for the computation of the column sequences of triangle A089504.
- Denominators used in A089505 to compute column sequences of triangle A089504.A089506
Denominators used in A089505 to compute column sequences of triangle A089504.
- Second column of triangle A089504 and second column of array A078741 divided by 18.A089507
Second column of triangle A089504 and second column of array A078741 divided by 18.
- Solution to a binomial problem together with companion sequence A081016(n-1).A089508
Solution to a binomial problem together with companion sequence A081016(n-1).
- a(n) = Kronecker(7/n).A089509
a(n) = Kronecker(7/n).
- A periodic sequence with period length 30.A089510
A periodic sequence with period length 30.