Sequences
392,541 sequences
- Lower triangular region of A082860.A082861
Lower triangular region of A082860.
- Prime(2^j) where j are the positions at which (prime(2^k+1)-prime(2^k))/log(prime(2^k)) set low-value records.A082862
Prime(2^j) where j are the positions at which (prime(2^k+1)-prime(2^k))/log(prime(2^k)) set low-value records.
- Number of distinct prime factors of n^2-1.A082863
Number of distinct prime factors of n^2-1.
- Decimal expansion of (-1)*c(2) where, in a neighborhood of zero, Gamma(x) = 1/x + c(0) + c(1)*x + c(2)*x^2 + ... (Gamma(x) denotes the Gamma function).A082864
Decimal expansion of (-1)*c(2) where, in a neighborhood of zero, Gamma(x) = 1/x + c(0) + c(1)*x + c(2)*x^2 + ... (Gamma(x) denotes the Gamma function).
- a(n) is the sum of the preceding terms that are coprime to n.A082865
a(n) is the sum of the preceding terms that are coprime to n.
- a(1)=1, a(2)=2, otherwise a(n) is the sum of the preceding terms a(j), 1<=j<n, where gcd(n,j)=1.A082866
a(1)=1, a(2)=2, otherwise a(n) is the sum of the preceding terms a(j), 1<=j<n, where gcd(n,j)=1.
- Numbers n such that there exists a proper divisor 1 < m < n where m divides n and m+1 divides n+1, but there is no divisor d such that d divides n, d+1 divides n+1 and d+2 divides n+2.A082867
Numbers n such that there exists a proper divisor 1 < m < n where m divides n and m+1 divides n+1, but there is no divisor d such that d divides n, d+1 divides n+1 and d+2 divides n+2.
- Continued fraction approximation to Product_{k>=2} zeta(k).A082868
Continued fraction approximation to Product_{k>=2} zeta(k).
- 3^n - 2^n is a semiprime.A082869
3^n - 2^n is a semiprime.
- Tribonacci array.A082870
Tribonacci array.
- First component x of pairs (x,y) where x <= y and x!+y! is a square, sorted on x.A082871
First component x of pairs (x,y) where x <= y and x!+y! is a square, sorted on x.
- a^n + b^n + c^n + ..., where a*b*c* ... is the prime factorization of n.A082872
a^n + b^n + c^n + ..., where a*b*c* ... is the prime factorization of n.
- Independence number of king KG_2 on triangle board B_n.A082873
Independence number of king KG_2 on triangle board B_n.
- Independence number of king KG_4 on triangle board B_n.A082874
Independence number of king KG_4 on triangle board B_n.
- Squares that are the sum of three factorials.A082875
Squares that are the sum of three factorials.
- Number of prime divisors (counted with multiplicity) of numbers of form a^n + b^n + c^n + ..., where a*b*c* ... is the prime factorization of n.A082876
Number of prime divisors (counted with multiplicity) of numbers of form a^n + b^n + c^n + ..., where a*b*c* ... is the prime factorization of n.
- a(n) = A002884(n) / A070731(n).A082877
a(n) = A002884(n) / A070731(n).
- Arithmetic derivative of numbers of the form p*q^k with distinct primes p and q, k > 0.A082878
Arithmetic derivative of numbers of the form p*q^k with distinct primes p and q, k > 0.
- Number of primes not exceeding the factorial of the n-th prime.A082879
Number of primes not exceeding the factorial of the n-th prime.
- Largest value of A075860(j) when j runs through composite numbers between n-th and (n+1)-th primes. That is, the largest fixed-point[=prime] reached by iteration of A008472(=sum of prime factors) initiated with composite values between two consecutive primes.A082880
Largest value of A075860(j) when j runs through composite numbers between n-th and (n+1)-th primes. That is, the largest fixed-point[=prime] reached by iteration of A008472(=sum of prime factors) initiated with composite values between two consecutive primes.
- Least value of A075860(j) when j runs through composite numbers between n-th and (n+1)-th primes. That is, the smallest fixed-point[=prime] reached by iteration of function A008472(=sum of prime factors) initiated with composite values between two consecutive primes.A082881
Least value of A075860(j) when j runs through composite numbers between n-th and (n+1)-th primes. That is, the smallest fixed-point[=prime] reached by iteration of function A008472(=sum of prime factors) initiated with composite values between two consecutive primes.
- Number of distinct values of A075860(j) when j runs through composite numbers between n-th and (n+1)-th primes. That is, the counts of different fixed-points[=prime] reached by iteration of function A008472(=sum of prime factors) initiated with composite values between two consecutive primes.A082882
Number of distinct values of A075860(j) when j runs through composite numbers between n-th and (n+1)-th primes. That is, the counts of different fixed-points[=prime] reached by iteration of function A008472(=sum of prime factors) initiated with composite values between two consecutive primes.
- Primes p(x) satisfying the following conditions: (a) A082882(x)=1; (b) {p(x),p(x+1)} are not twin primes; (c) values of A075860(j) for j composites between these two non-twin primes are identical.A082883
Primes p(x) satisfying the following conditions: (a) A082882(x)=1; (b) {p(x),p(x+1)} are not twin primes; (c) values of A075860(j) for j composites between these two non-twin primes are identical.
- a(n) = smallest prime p for which (r-p)/log(p) < 1/n, where r is the next prime after p.A082884
a(n) = smallest prime p for which (r-p)/log(p) < 1/n, where r is the next prime after p.
- Primes followed by a larger-than-average prime gap.A082885
Primes followed by a larger-than-average prime gap.
- a(n) = floor((prime(n+1)-prime(n))/log(prime(n))).A082886
a(n) = floor((prime(n+1)-prime(n))/log(prime(n))).
- a(n) = gcd(n! mod 2^n, (n+1)! mod 2^(n+1)).A082887
a(n) = gcd(n! mod 2^n, (n+1)! mod 2^(n+1)).
- Primes p such that (r-p)/log(p) > 3, where r is the next prime after p.A082888
Primes p such that (r-p)/log(p) > 3, where r is the next prime after p.
- Primes p such that (r-p)/log(p) > 4, where r is the next prime after p.A082889
Primes p such that (r-p)/log(p) > 4, where r is the next prime after p.
- Primes p such that (r-p)/log(p) > 5, where r is the next prime after p.A082890
Primes p such that (r-p)/log(p) > 5, where r is the next prime after p.
- Smallest prime p such that q = (r-p)/log(p) > n, where r is the next prime after p.A082891
Smallest prime p such that q = (r-p)/log(p) > n, where r is the next prime after p.
- a(n) = floor(2*n/log(A000230(n))).A082892
a(n) = floor(2*n/log(A000230(n))).
- a(n) is the closest number to n-th prime which is divisible by n.A082893
a(n) is the closest number to n-th prime which is divisible by n.
- a(n) is the closest number to 2^n which is divisible by n.A082894
a(n) is the closest number to 2^n which is divisible by n.
- Closest number to sigma(n) = A000203(n) which is divisible by n.A082895
Closest number to sigma(n) = A000203(n) which is divisible by n.
- a(n) = A082893(n)/n.A082896
a(n) = A082893(n)/n.
- Perfect totient numbers.A082897
Perfect totient numbers.
- a(n) = A082895(n)/n, where A082895(n) is the closest number to sigma(n) which is divisible by n.A082898
a(n) = A082895(n)/n, where A082895(n) is the closest number to sigma(n) which is divisible by n.
- a(n) = A082893(n)-A000040(n), that is difference of n-th prime and number closest to it and divisible by n.A082899
a(n) = A082893(n)-A000040(n), that is difference of n-th prime and number closest to it and divisible by n.
- a(n) = A082894(n)-A000079(n), the difference of 2^n and the number closest to it and divisible by n.A082900
a(n) = A082894(n)-A000079(n), the difference of 2^n and the number closest to it and divisible by n.
- a(n) = A082895(n)-A000203(n); the distance from sigma(n) to that multiple of n which is closest to sigma(n), positive terms for cases where the closest multiple is after sigma(n), and negative terms where it is before sigma(n). In case of ties, a positive term is selected.A082901
a(n) = A082895(n)-A000203(n); the distance from sigma(n) to that multiple of n which is closest to sigma(n), positive terms for cases where the closest multiple is after sigma(n), and negative terms where it is before sigma(n). In case of ties, a positive term is selected.
- a(n) = gcd(2^n, sigma(2,n)) = gcd(A000079(n), A001157(n)).A082902
a(n) = gcd(2^n, sigma(2,n)) = gcd(A000079(n), A001157(n)).
- Highest power of two that divides the sum of divisors of n.A082903
Highest power of two that divides the sum of divisors of n.
- Triangle read by rows: Pascal's triangle restricted to binomial(n, d) where d is a divisor of n.A082904
Triangle read by rows: Pascal's triangle restricted to binomial(n, d) where d is a divisor of n.
- Modified Pascal-triangle, read by rows. All C(n,j) binomial coefficients are replaced by C(n/g, j/g), where g = gcd(n,j).A082905
Modified Pascal-triangle, read by rows. All C(n,j) binomial coefficients are replaced by C(n/g, j/g), where g = gcd(n,j).
- Sum of terms in n-th row of modified Pascal's triangle displayed in A082905.A082906
Sum of terms in n-th row of modified Pascal's triangle displayed in A082905.
- A modified Pascal's triangle, read by rows, and modified as follows: binomial(n,j) is replaced by gcd(2^n, binomial(n,j)), i.e., the largest power of 2 dividing binomial(n,j).A082907
A modified Pascal's triangle, read by rows, and modified as follows: binomial(n,j) is replaced by gcd(2^n, binomial(n,j)), i.e., the largest power of 2 dividing binomial(n,j).
- Largest value of gcd(2^n, binomial(n,j)) with j=0..n-1; maximum value of largest power of 2 dividing binomial(n,j) in the n-th row of Pascal's triangle.A082908
Largest value of gcd(2^n, binomial(n,j)) with j=0..n-1; maximum value of largest power of 2 dividing binomial(n,j) in the n-th row of Pascal's triangle.
- a(n) = Sum_{d|n} (d mod 3).A082909
a(n) = Sum_{d|n} (d mod 3).
- a(n) = prime(prime(n+1)-prime(n)).A082910
a(n) = prime(prime(n+1)-prime(n)).