Sequences
392,541 sequences
- Number of rooted trees with n nodes with every leaf at height 6.A048811
Number of rooted trees with n nodes with every leaf at height 6.
- Number of rooted trees with n nodes with every leaf at height 7.A048812
Number of rooted trees with n nodes with every leaf at height 7.
- Number of rooted trees with n nodes with every leaf at height 8.A048813
Number of rooted trees with n nodes with every leaf at height 8.
- Number of rooted trees with n nodes with every leaf at height 9.A048814
Number of rooted trees with n nodes with every leaf at height 9.
- Number of rooted trees with n nodes with every leaf at height 10.A048815
Number of rooted trees with n nodes with every leaf at height 10.
- Number of rooted trees with n nodes with every leaf at the same height.A048816
Number of rooted trees with n nodes with every leaf at the same height.
- Numerators of convergents to A058914.A048817
Numerators of convergents to A058914.
- Denominators of convergents to A058914.A048818
Denominators of convergents to A058914.
- Decimal expansion of one of four fixed points (mod 1) of Minkowski's question mark function.A048819
Decimal expansion of one of four fixed points (mod 1) of Minkowski's question mark function.
- Binary expansion of one of four fixed points (mod 1) of Minkowski's question mark function.A048820
Binary expansion of one of four fixed points (mod 1) of Minkowski's question mark function.
- Lengths of runs in A048820.A048821
Lengths of runs in A048820.
- a(n) = least k such that A048821(k) = n.A048822
a(n) = least k such that A048821(k) = n.
- a(n) = value of n defined as follows: start with n and reach 2 by repeatedly either dividing by d where d <= the square root or by subtracting 1. The division steps are free, but subtracting 1 costs 1 point. The "value" of n is the smallest cost to reach 2.A048823
a(n) = value of n defined as follows: start with n and reach 2 by repeatedly either dividing by d where d <= the square root or by subtracting 1. The division steps are free, but subtracting 1 costs 1 point. The "value" of n is the smallest cost to reach 2.
- a(n) = least k such that A048823(n) = k.A048824
a(n) = least k such that A048823(n) = k.
- Start with n and reach 2 by repeatedly either dividing by d where d <= the square root or by adding 1. The division steps are free, but adding 1 costs 1 point. a(n) is the smallest cost to reach 2.A048825
Start with n and reach 2 by repeatedly either dividing by d where d <= the square root or by adding 1. The division steps are free, but adding 1 costs 1 point. a(n) is the smallest cost to reach 2.
- a(n) = least k such that A048825(k) = n.A048826
a(n) = least k such that A048825(k) = n.
- a(n) = least k such that A047988(k) = n.A048827
a(n) = least k such that A047988(k) = n.
- Number of identity (asymmetric) trees of width n.A048828
Number of identity (asymmetric) trees of width n.
- Number of rooted identity game trees of height <=n, first player to reach to reach top wins. Second player wins.A048829
Number of rooted identity game trees of height <=n, first player to reach to reach top wins. Second player wins.
- Number of rooted identity game trees of height <=n, first player to reach to reach top wins. First player wins.A048830
Number of rooted identity game trees of height <=n, first player to reach to reach top wins. First player wins.
- Number of rooted identity game trees of height n, first player to reach to reach top wins. Second player wins.A048831
Number of rooted identity game trees of height n, first player to reach to reach top wins. Second player wins.
- Number of rooted identity game trees of height n, first player to reach to reach top wins. First player wins.A048832
Number of rooted identity game trees of height n, first player to reach to reach top wins. First player wins.
- Number of starting positions of Nim with 2n pieces such that 2nd player wins. Partitions of 2n such that xor-sum of partitions is 0.A048833
Number of starting positions of Nim with 2n pieces such that 2nd player wins. Partitions of 2n such that xor-sum of partitions is 0.
- Decimal expansion of Sum_{n >= 2} (K(n)/n!), where K(n) is A002034.A048834
Decimal expansion of Sum_{n >= 2} (K(n)/n!), where K(n) is A002034.
- Decimal expansion of Sum_{n >= 2} (1/Product_{i=2..n} K(i)) where K(i) is the Kempner function A002034.A048835
Decimal expansion of Sum_{n >= 2} (1/Product_{i=2..n} K(i)) where K(i) is the Kempner function A002034.
- Decimal expansion of Sum_{n >= 2} (n / Product_{i=2..n} K(i)), where K(i) is the Kempner function A002034.A048836
Decimal expansion of Sum_{n >= 2} (n / Product_{i=2..n} K(i)), where K(i) is the Kempner function A002034.
- Decimal expansion of Sum_{n >= 2} (n^2 / Product_{i=2..n} K(i)), where K(i) is the Kempner function A002034.A048837
Decimal expansion of Sum_{n >= 2} (n^2 / Product_{i=2..n} K(i)), where K(i) is the Kempner function A002034.
- Decimal expansion of Sum_{n >= 2} (n^3 / Product_{i=2..n} K(i)), where K(i) is the Kempner function A002034.A048838
Decimal expansion of Sum_{n >= 2} (n^3 / Product_{i=2..n} K(i)), where K(i) is the Kempner function A002034.
- Numbers k dividing P(k)!, where P(k) is the largest prime factor of k.A048839
Numbers k dividing P(k)!, where P(k) is the largest prime factor of k.
- Expansion of (1 - x + 2*x^2 + 2*x^3 - x^4 - x^5)/(1-x)^3.A048840
Expansion of (1 - x + 2*x^2 + 2*x^3 - x^4 - x^5)/(1-x)^3.
- Least positive integer k for which 11^n divides k!.A048841
Least positive integer k for which 11^n divides k!.
- Least positive integer k for which 13^n divides k!.A048842
Least positive integer k for which 13^n divides k!.
- Least positive integer k for which 17^n divides k!.A048843
Least positive integer k for which 17^n divides k!.
- Least positive integer k for which 19^n divides k!.A048844
Least positive integer k for which 19^n divides k!.
- Least positive integer k for which 23^n divides k!.A048845
Least positive integer k for which 23^n divides k!.
- Least positive integer k for which 29^n divides k!.A048846
Least positive integer k for which 29^n divides k!.
- Primes formed by concatenation of first k odd numbers.A048847
Primes formed by concatenation of first k odd numbers.
- a(n) = prime(phi(n)).A048848
a(n) = prime(phi(n)).
- a(n) = prime(phi(n)) + phi(prime(n)).A048849
a(n) = prime(phi(n)) + phi(prime(n)).
- Position of n in sequence A047708.A048850
Position of n in sequence A047708.
- Length of hypotenuse squared in right triangle formed by a prime spiral plotted in Cartesian coordinates.A048851
Length of hypotenuse squared in right triangle formed by a prime spiral plotted in Cartesian coordinates.
- Difference between b^2 (in c^2=a^2+b^2) and product of successive prime pairs.A048852
Difference between b^2 (in c^2=a^2+b^2) and product of successive prime pairs.
- Number of primes (different from n) that can be produced by altering one digit of decimal expansion of n (without changing the number of digits).A048853
Number of primes (different from n) that can be produced by altering one digit of decimal expansion of n (without changing the number of digits).
- Triangle read by rows. A generalization of unsigned Lah numbers, called L[4,1].A048854
Triangle read by rows. A generalization of unsigned Lah numbers, called L[4,1].
- Number of integers up to n! relatively prime to n!.A048855
Number of integers up to n! relatively prime to n!.
- Number of digits of prime(n)# + 1.A048856
Number of digits of prime(n)# + 1.
- A005420 prefixed with a 0.A048857
A005420 prefixed with a 0.
- Number of prime factors of 1+(n!)^2 (with multiplicity).A048858
Number of prime factors of 1+(n!)^2 (with multiplicity).
- A sieve: keep the first 2 numbers, delete the next 3 numbers; keep the next 3 numbers, delete the next 4 numbers; keep the next 4 numbers, delete the next 5 numbers; and so on. In other words, keep the next k numbers and delete the next k+1 numbers, for k = 2, 3, ...A048859
A sieve: keep the first 2 numbers, delete the next 3 numbers; keep the next 3 numbers, delete the next 4 numbers; keep the next 4 numbers, delete the next 5 numbers; and so on. In other words, keep the next k numbers and delete the next k+1 numbers, for k = 2, 3, ...
- Smallest denominator d such that the Sylvester expansion of n/d has n terms.A048860
Smallest denominator d such that the Sylvester expansion of n/d has n terms.