Sequences
392,541 sequences
- Composite numbers k such that number of composite d with 3 < d < k, gcd(k, d) = 1, is pi(k).A049011
Composite numbers k such that number of composite d with 3 < d < k, gcd(k, d) = 1, is pi(k).
- Composite numbers n such that number of nonprime d with 0 < d < n, gcd(n,d)=1, is pi(n).A049012
Composite numbers n such that number of nonprime d with 0 < d < n, gcd(n,d)=1, is pi(n).
- Duplicate of A020735.A049013
Duplicate of A020735.
- n plus a googol is prime.A049014
n plus a googol is prime.
- Numbers k such that the sum of the first k Mersenne prime exponents is prime.A049015
Numbers k such that the sum of the first k Mersenne prime exponents is prime.
- Expansion of 1/((1-x)^5 - x^5).A049016
Expansion of 1/((1-x)^5 - x^5).
- Expansion of 1/((1-x)^7 - x^7).A049017
Expansion of 1/((1-x)^7 - x^7).
- Expansion of 1/((1+x)^7 - x^7).A049018
Expansion of 1/((1+x)^7 - x^7).
- Irregular triangle read by rows: Row n gives numbers of preferential arrangements (onto functions) of n objects that are associated with the partition of n, taken in Abramowitz and Stegun order.A049019
Irregular triangle read by rows: Row n gives numbers of preferential arrangements (onto functions) of n objects that are associated with the partition of n, taken in Abramowitz and Stegun order.
- Triangle of numbers a(n,k), 0 <= k <= n: number of set partitions of {1,2,...,n} in which exactly k of the blocks have been distinguished.A049020
Triangle of numbers a(n,k), 0 <= k <= n: number of set partitions of {1,2,...,n} in which exactly k of the blocks have been distinguished.
- Number of topologically distinct ways to dissect a rectangle into n rectangles.A049021
Number of topologically distinct ways to dissect a rectangle into n rectangles.
- Recurring combinations: a(n) = C(a(n-1),a(n-2)).A049022
Recurring combinations: a(n) = C(a(n-1),a(n-2)).
- Smaller of amicable pairs of Euler's first form with GCD a power of 2.A049023
Smaller of amicable pairs of Euler's first form with GCD a power of 2.
- Greater of amicable pairs of Euler's first form with GCD a power of 2.A049024
Greater of amicable pairs of Euler's first form with GCD a power of 2.
- Smaller of amicable pair of Euler's first form with GCD a prime times a power of 2.A049025
Smaller of amicable pair of Euler's first form with GCD a prime times a power of 2.
- Greater of amicable pair of Euler's first form with GCD a prime times a power of 2.A049026
Greater of amicable pair of Euler's first form with GCD a prime times a power of 2.
- G.f.: (1-2*x*c(x))/(1-3*x*c(x)) where c(x) = (1 - sqrt(1-4*x))/(2*x) is the g.f. for Catalan numbers A000108.A049027
G.f.: (1-2*x*c(x))/(1-3*x*c(x)) where c(x) = (1 - sqrt(1-4*x))/(2*x) is the g.f. for Catalan numbers A000108.
- Row sums of triangle A035529.A049028
Row sums of triangle A035529.
- Triangle read by rows, the Bell transform of the quartic factorial numbers A007696(n+1) without column 0.A049029
Triangle read by rows, the Bell transform of the quartic factorial numbers A007696(n+1) without column 0.
- Sum of sigma(j) for 1<=j<10^n, where sigma(j) = A048050(j) is the sum of the proper divisors >1 of j (excluding 1 and n).A049030
Sum of sigma(j) for 1<=j<10^n, where sigma(j) = A048050(j) is the sum of the proper divisors >1 of j (excluding 1 and n).
- Maximization of sums of cubes of integer differences (b_[ i ]-i)^3 over permutations {b_[ i ], for i-1,2,...,n} on first n integers.A049031
Maximization of sums of cubes of integer differences (b_[ i ]-i)^3 over permutations {b_[ i ], for i-1,2,...,n} on first n integers.
- A049031/2.A049032
A049031/2.
- Central factorial numbers: unsigned 2nd subdiagonal of A182867.A049033
Central factorial numbers: unsigned 2nd subdiagonal of A182867.
- Scaled sums of odd reciprocals.A049034
Scaled sums of odd reciprocals.
- Number of pairs of twin primes whose smaller element is <= 10^n-th prime.A049035
Number of pairs of twin primes whose smaller element is <= 10^n-th prime.
- Mean gap between successive primes up to k-th prime is an integer.A049036
Mean gap between successive primes up to k-th prime is an integer.
- Number of cubic lattice walks that start and end at origin after 2n steps, not touching origin at intermediate stages.A049037
Number of cubic lattice walks that start and end at origin after 2n steps, not touching origin at intermediate stages.
- Primes arising in A049036.A049038
Primes arising in A049036.
- Geometric Connell sequence: 1 odd, 2 even, 4 odd, 8 even, ...A049039
Geometric Connell sequence: 1 odd, 2 even, 4 odd, 8 even, ...
- Number of Sophie Germain primes <= prime(10^n).A049040
Number of Sophie Germain primes <= prime(10^n).
- Least k > 0 such that A049042(n) | A003422(k-1).A049041
Least k > 0 such that A049042(n) | A003422(k-1).
- Domain of A049041.A049042
Domain of A049041.
- Primes not in domain of A049041.A049043
Primes not in domain of A049041.
- Least k > 0 such that A049045(n) | A003422(k-1).A049044
Least k > 0 such that A049045(n) | A003422(k-1).
- Domain of A049044.A049045
Domain of A049044.
- Number of k >= 1 with k! == 1 (mod n).A049046
Number of k >= 1 with k! == 1 (mod n).
- Number of distinct factorial numbers congruent to 1 (mod prime(n)).A049047
Number of distinct factorial numbers congruent to 1 (mod prime(n)).
- Composite numbers n such that k! == 1 (mod n) for some k > 2.A049048
Composite numbers n such that k! == 1 (mod n) for some k > 2.
- a(n)! == 1 (mod A049048(n)).A049049
a(n)! == 1 (mod A049048(n)).
- Least p with exactly n distinct factorial numbers == 1 (mod p).A049050
Least p with exactly n distinct factorial numbers == 1 (mod p).
- Numbers k such that k through k+4 all have the same number of divisors.A049051
Numbers k such that k through k+4 all have the same number of divisors.
- Numbers k such that k through k+5 all have the same number of divisors.A049052
Numbers k such that k through k+5 all have the same number of divisors.
- Numbers k such that k through k+6 all have the same number of divisors.A049053
Numbers k such that k through k+6 all have the same number of divisors.
- Numbers k such that 10^k + 3 is prime.A049054
Numbers k such that 10^k + 3 is prime.
- Triangle read by rows, giving T(n,k) = number of k-member minimal ordered covers of a labeled n-set (1 <= k <= n).A049055
Triangle read by rows, giving T(n,k) = number of k-member minimal ordered covers of a labeled n-set (1 <= k <= n).
- Number of minimal ordered covers of a labeled n-set.A049056
Number of minimal ordered covers of a labeled n-set.
- First element r of (-1)sigma sociable triple (r,s,t): s=(-1)sigma(r), t=(-1)sigma(s), r=(-1)sigma(t), where if x=Product p(i)^r(i), then (-1)sigma(x)=Product(-1+(Sum p(i)^s(i), s(i)=1 to r(i))).A049057
First element r of (-1)sigma sociable triple (r,s,t): s=(-1)sigma(r), t=(-1)sigma(s), r=(-1)sigma(t), where if x=Product p(i)^r(i), then (-1)sigma(x)=Product(-1+(Sum p(i)^s(i), s(i)=1 to r(i))).
- Second element s of (-1)sigma sociable triple (r,s,t): s=(-1)sigma(r), t=(-1)sigma(s), r=(-1)sigma(t), where if x=Product p(i)^r(i), then (-1)sigma(x)=Product(-1+(Sum p(i)^s(i), s(i)=1 to r(i))).A049058
Second element s of (-1)sigma sociable triple (r,s,t): s=(-1)sigma(r), t=(-1)sigma(s), r=(-1)sigma(t), where if x=Product p(i)^r(i), then (-1)sigma(x)=Product(-1+(Sum p(i)^s(i), s(i)=1 to r(i))).
- Third element t of (-1)sigma sociable triple (r,s,t): s=(-1)sigma(r), t=(-1)sigma(s), r=(-1)sigma(t), where if x=Product p(i)^r(i), then (-1)sigma(x)=Product(-1+(Sum p(i)^s(i), s(i)=1 to r(i))).A049059
Third element t of (-1)sigma sociable triple (r,s,t): s=(-1)sigma(r), t=(-1)sigma(s), r=(-1)sigma(t), where if x=Product p(i)^r(i), then (-1)sigma(x)=Product(-1+(Sum p(i)^s(i), s(i)=1 to r(i))).
- a(n) = (-1)^omega(n)*Sum_{d|n} d*(-1)^omega(d), where omega(n) = A001221(n) is number of distinct primes dividing n.A049060
a(n) = (-1)^omega(n)*Sum_{d|n} d*(-1)^omega(d), where omega(n) = A001221(n) is number of distinct primes dividing n.