Sequences
392,541 sequences
- Numbers k such that Sum_{j} p_j = Sum_{j} e_j where Product_{j} p_j^(e_j) is the prime factorization of k.A054411
Numbers k such that Sum_{j} p_j = Sum_{j} e_j where Product_{j} p_j^(e_j) is the prime factorization of k.
- Numbers k such that, in the prime factorization of k, the product of exponents equals the product of prime factors.A054412
Numbers k such that, in the prime factorization of k, the product of exponents equals the product of prime factors.
- a(n) = 7*a(n-1) + a(n-2), with a(0)=1 and a(1)=7.A054413
a(n) = 7*a(n-1) + a(n-2), with a(0)=1 and a(1)=7.
- a(n) = 1 + floor(n/(1-log(2)/log(3))).A054414
a(n) = 1 + floor(n/(1-log(2)/log(3))).
- Smallest prime factor of n!-1 (for n>2), a(2)=1.A054415
Smallest prime factor of n!-1 (for n>2), a(2)=1.
- Numbers k such that 9090...9091 (with k-1 copies of 90 and one copy of 91) is prime.A054416
Numbers k such that 9090...9091 (with k-1 copies of 90 and one copy of 91) is prime.
- Number of connected 3 X n binary matrices with rightmost column [1,0,0]'.A054417
Number of connected 3 X n binary matrices with rightmost column [1,0,0]'.
- Number of connected 3 X n binary matrices with rightmost column [1,1,1]', divided by 4.A054418
Number of connected 3 X n binary matrices with rightmost column [1,1,1]', divided by 4.
- Number of connected 3 X n binary matrices (divided by 2).A054419
Number of connected 3 X n binary matrices (divided by 2).
- Number of connectable 3 X n binary matrices.A054420
Number of connectable 3 X n binary matrices.
- Number of disconnected 3 X n binary matrices.A054421
Number of disconnected 3 X n binary matrices.
- Number of unlabeled asymmetric ternary cacti having n triangles.A054422
Number of unlabeled asymmetric ternary cacti having n triangles.
- Number of unlabeled 3-gonal cacti having n triangles.A054423
Number of unlabeled 3-gonal cacti having n triangles.
- Permutation of natural numbers: maps the canonical list of fractions (A020652/A020653) to whole Stern-Brocot (Farey) tree (top = 1/1 and both sides < 1 and > 1, but excluding the "fractions" 0/1 and 1/0).A054424
Permutation of natural numbers: maps the canonical list of fractions (A020652/A020653) to whole Stern-Brocot (Farey) tree (top = 1/1 and both sides < 1 and > 1, but excluding the "fractions" 0/1 and 1/0).
- A054424 expanded to normal triangular array, with zeros at those (x,y) where x and y are not relatively prime.A054425
A054424 expanded to normal triangular array, with zeros at those (x,y) where x and y are not relatively prime.
- Inverse permutation to A054424.A054426
Inverse permutation to A054424.
- Permutation of natural numbers: maps the fractions A038567/A038566 to the right side (n/m > 1) of Stern-Brocot tree.A054427
Permutation of natural numbers: maps the fractions A038567/A038566 to the right side (n/m > 1) of Stern-Brocot tree.
- Inverse permutation to A054427.A054428
Inverse permutation to A054427.
- Simple self-inverse permutation of natural numbers: List each block of 2^n numbers (from 2^n to 2^(n+1) - 1) in reverse order.A054429
Simple self-inverse permutation of natural numbers: List each block of 2^n numbers (from 2^n to 2^(n+1) - 1) in reverse order.
- Simple self-inverse permutation of natural numbers: List each clump of phi(n) numbers (starting from phi(2) = 1) in reverse order.A054430
Simple self-inverse permutation of natural numbers: List each clump of phi(n) numbers (starting from phi(2) = 1) in reverse order.
- Array read by antidiagonals: T(x, y) tells whether (x, y) are coprime (1) or not (0).A054431
Array read by antidiagonals: T(x, y) tells whether (x, y) are coprime (1) or not (0).
- a(n) = Sum_{1<=k<=n, gcd(k,n)=1} 2^(k-1).A054432
a(n) = Sum_{1<=k<=n, gcd(k,n)=1} 2^(k-1).
- Numbers formed by interpreting the reduced residue set of every even number as a Zeckendorf Expansion.A054433
Numbers formed by interpreting the reduced residue set of every even number as a Zeckendorf Expansion.
- Number of possible positions in an n X n X n Rubik's cube reachable from the starting position.A054434
Number of possible positions in an n X n X n Rubik's cube reachable from the starting position.
- Smallest area of a Pythagorean triangle with n as length of one of the three sides.A054435
Smallest area of a Pythagorean triangle with n as length of one of the three sides.
- Smallest area of a Pythagorean triangle with n as length of a leg.A054436
Smallest area of a Pythagorean triangle with n as length of a leg.
- Maximal subscripts within generalized Fibonacci sequence containing n.A054437
Maximal subscripts within generalized Fibonacci sequence containing n.
- Third derivative of n.A054438
Third derivative of n.
- Fourth derivative of n.A054439
Fourth derivative of n.
- Number of ordered pairs of partitions of n with no common parts.A054440
Number of ordered pairs of partitions of n with no common parts.
- Convolution of (shifted) A026671 with A000984 (central binomial coefficients of even order).A054441
Convolution of (shifted) A026671 with A000984 (central binomial coefficients of even order).
- Second convolution of A001405 (central binomial numbers).A054442
Second convolution of A001405 (central binomial numbers).
- Third convolution of A001405 (central binomial numbers).A054443
Third convolution of A001405 (central binomial numbers).
- Even-indexed terms of A001629(n), n >= 2, (Fibonacci convolution).A054444
Even-indexed terms of A001629(n), n >= 2, (Fibonacci convolution).
- Triangle read by rows giving partial row sums of triangle A033184(n,m), n >= m >= 1 (Catalan triangle).A054445
Triangle read by rows giving partial row sums of triangle A033184(n,m), n >= m >= 1 (Catalan triangle).
- Triangle of partial row sums of triangle A037027(n,m), n >= m >= 0 (Fibonacci convolution triangle).A054446
Triangle of partial row sums of triangle A037027(n,m), n >= m >= 0 (Fibonacci convolution triangle).
- Row sums of triangle A054446 (partial row sums triangle of Fibonacci convolution triangle).A054447
Row sums of triangle A054446 (partial row sums triangle of Fibonacci convolution triangle).
- Triangle of partial row sums of triangle A054446(n,m), n >= m >= 0.A054448
Triangle of partial row sums of triangle A054446(n,m), n >= m >= 0.
- Row sums of triangle A054448 (second member of partial row sums triangle family of Fibonacci convolution triangle).A054449
Row sums of triangle A054448 (second member of partial row sums triangle family of Fibonacci convolution triangle).
- Triangle of partial row sums of unsigned triangle A049310(n,m), n >= m >= 0 (Chebyshev S-polynomials).A054450
Triangle of partial row sums of unsigned triangle A049310(n,m), n >= m >= 0 (Chebyshev S-polynomials).
- Third column of triangle A054450 (partial row sums of unsigned Chebyshev triangle A049310).A054451
Third column of triangle A054450 (partial row sums of unsigned Chebyshev triangle A049310).
- Partial sums of A027941(n-1) with a(-1) = 0.A054452
Partial sums of A027941(n-1) with a(-1) = 0.
- Triangle of partial row sums of triangle A054450(n,m), n >= m >= 0.A054453
Triangle of partial row sums of triangle A054450(n,m), n >= m >= 0.
- Third column of triangle A054453.A054454
Third column of triangle A054453.
- Row sums of triangle A054453.A054455
Row sums of triangle A054453.
- Convolution triangle of A000129(n) (Pell numbers).A054456
Convolution triangle of A000129(n) (Pell numbers).
- Pell numbers A000129(n+1) (without P(0)) convoluted twice with itself.A054457
Pell numbers A000129(n+1) (without P(0)) convoluted twice with itself.
- Convolution triangle based on A001333(n), n >= 1.A054458
Convolution triangle based on A001333(n), n >= 1.
- A001333(n), n >= 1, convolved with itself.A054459
A001333(n), n >= 1, convolved with itself.
- A001333(n), n >= 1, convolved twice with itself.A054460
A001333(n), n >= 1, convolved twice with itself.