Sequences
392,541 sequences
- Smallest square greater than or equal to n.A048761
Smallest square greater than or equal to n.
- Largest cube <= n.A048762
Largest cube <= n.
- Smallest cube >= n.A048763
Smallest cube >= n.
- Largest factorial <= n.A048764
Largest factorial <= n.
- Smallest factorial >= n.A048765
Smallest factorial >= n.
- Integer part of cube root of n. Or, number of cubes <= n. Or, n appears 3n^2 + 3n + 1 times.A048766
Integer part of cube root of n. Or, number of cubes <= n. Or, n appears 3n^2 + 3n + 1 times.
- If n = Product (p_j^k_j) then a(n) = Product ( prime(k_j)^pi(p_j) ) where pi is A000720.A048767
If n = Product (p_j^k_j) then a(n) = Product ( prime(k_j)^pi(p_j) ) where pi is A000720.
- Numbers n such that A048767(n) = n.A048768
Numbers n such that A048767(n) = n.
- Numbers n such that A048767(n+1)=A048767(n).A048769
Numbers n such that A048767(n+1)=A048767(n).
- Partial sums of A048694.A048770
Partial sums of A048694.
- Partial sums of A048695.A048771
Partial sums of A048695.
- Partial sums of A048696.A048772
Partial sums of A048696.
- Partial sums of A048697.A048773
Partial sums of A048697.
- Numerators of coefficients in a formula for the n-th composite number.A048774
Numerators of coefficients in a formula for the n-th composite number.
- Number of (partially defined) monotone maps from intervals of 1..n to 1..n.A048775
Number of (partially defined) monotone maps from intervals of 1..n to 1..n.
- First partial sums of A048739; second partial sums of A000129.A048776
First partial sums of A048739; second partial sums of A000129.
- First partial sums of A005409; second partial sums of A001333.A048777
First partial sums of A005409; second partial sums of A001333.
- First partial sums of A048745; second partial sums of A048654.A048778
First partial sums of A048745; second partial sums of A048654.
- Coefficients of power series for (1 - (1-8*x)^(1/4))/2.A048779
Coefficients of power series for (1 - (1-8*x)^(1/4))/2.
- Erroneous version of A006459.A048780
Erroneous version of A006459.
- Number of triangles in minimal triangle graphs.A048781
Number of triangles in minimal triangle graphs.
- Smallest positive number of "triangular" shuffles of n(n+1)/2 cards needed to restore them to their original order.A048782
Smallest positive number of "triangular" shuffles of n(n+1)/2 cards needed to restore them to their original order.
- Numbers n such that prime(n) - sigma(n) - phi(n) = prime(n+1) - sigma(n+1) - phi(n+1), where sigma(n) = sum of divisors of n.A048783
Numbers n such that prime(n) - sigma(n) - phi(n) = prime(n+1) - sigma(n+1) - phi(n+1), where sigma(n) = sum of divisors of n.
- a(n) = tau(binomial(2*n,n)), where tau = number of divisors (A000005).A048784
a(n) = tau(binomial(2*n,n)), where tau = number of divisors (A000005).
- a(0) = 0; a(n) = tau(n^3), where tau = number of divisors (A000005).A048785
a(0) = 0; a(n) = tau(n^3), where tau = number of divisors (A000005).
- Triangle of coefficients of certain exponential convolution polynomials.A048786
Triangle of coefficients of certain exponential convolution polynomials.
- Write n in base 3 then rotate left one place.A048787
Write n in base 3 then rotate left one place.
- a(2n+1) = a(2n) + a(2n-1), a(2n) = 2*a(2n-1) + a(2n-2); a(n) = n for n = 0, 1.A048788
a(2n+1) = a(2n) + a(2n-1), a(2n) = 2*a(2n-1) + a(2n-2); a(n) = n for n = 0, 1.
- "Densities" of the four-dimensional starry polytopes.A048789
"Densities" of the four-dimensional starry polytopes.
- Array read by antidiagonals: T(n,k) = number of rooted n-dimensional polycubes with k cells, with no symmetries removed (n >= 1, k >= 1).A048790
Array read by antidiagonals: T(n,k) = number of rooted n-dimensional polycubes with k cells, with no symmetries removed (n >= 1, k >= 1).
- Numbers n such that n_0=n_1=n_2, where n_i = (n+i)-th prime - sigma(n+i) - phi(n+i).A048791
Numbers n such that n_0=n_1=n_2, where n_i = (n+i)-th prime - sigma(n+i) - phi(n+i).
- When cubed gives number composed just of the digits 0, 1, 2, 3, 4.A048792
When cubed gives number composed just of the digits 0, 1, 2, 3, 4.
- List giving all subsets of natural numbers arranged in standard statistical (or Yates) order.A048793
List giving all subsets of natural numbers arranged in standard statistical (or Yates) order.
- Subsets of natural numbers arranged in standard statistical (or Yates) order.A048794
Subsets of natural numbers arranged in standard statistical (or Yates) order.
- Concatenate p p times, where p runs through the primes.A048795
Concatenate p p times, where p runs through the primes.
- Palindromic primes formed from decimal expansion of Pi written backwards then forwards.A048796
Palindromic primes formed from decimal expansion of Pi written backwards then forwards.
- Primes p such that pp'-2 is prime, where p' denotes the next prime after p.A048797
Primes p such that pp'-2 is prime, where p' denotes the next prime after p.
- Smallest k > 0 such that n*k is a perfect cube.A048798
Smallest k > 0 such that n*k is a perfect cube.
- Decimal expansion of Sum_{n >= 2} 1/S(n)!, where S(n) is the Kempner number A002034(n).A048799
Decimal expansion of Sum_{n >= 2} 1/S(n)!, where S(n) is the Kempner number A002034(n).
- E.g.f. satisfies A(x) = 1 + x * A(x / (1 - x)).A048800
E.g.f. satisfies A(x) = 1 + x * A(x / (1 - x)).
- E.g.f. A(x) satisfies A(x) = 1 + x * A(exp(x) - 1).A048801
E.g.f. A(x) satisfies A(x) = 1 + x * A(exp(x) - 1).
- Number of labeled rooted trees of nonempty sets with n points. (Each node is a set of 1 or more points.)A048802
Number of labeled rooted trees of nonempty sets with n points. (Each node is a set of 1 or more points.)
- a(n) = Product_{k=1..n} rad(k), where rad(n) is the product of distinct prime factors of n, cf. A007947.A048803
a(n) = Product_{k=1..n} rad(k), where rad(n) is the product of distinct prime factors of n, cf. A007947.
- Triangle: T(n,k) = b(n)/(b(k)*b(n-k)) where b is A048803.A048804
Triangle: T(n,k) = b(n)/(b(k)*b(n-k)) where b is A048803.
- Matrix inverse of A048804.A048805
Matrix inverse of A048804.
- Column 0 of A048805.A048806
Column 0 of A048805.
- Matrix square of A048804.A048807
Matrix square of A048804.
- Number of rooted trees with n nodes with every leaf at height 3.A048808
Number of rooted trees with n nodes with every leaf at height 3.
- Number of rooted trees with n nodes with every leaf at height 4.A048809
Number of rooted trees with n nodes with every leaf at height 4.
- Number of rooted trees with n nodes with every leaf at height 5.A048810
Number of rooted trees with n nodes with every leaf at height 5.