Sequences
392,541 sequences
- Number of common divisors of n and phi(n).A073811
Number of common divisors of n and phi(n).
- Number of common divisors of sigma(n) and phi(n).A073812
Number of common divisors of sigma(n) and phi(n).
- Difference between n and largest unrelated number belonging to n, when n runs over composite numbers. For primes and for 4, unrelated set is empty.A073813
Difference between n and largest unrelated number belonging to n, when n runs over composite numbers. For primes and for 4, unrelated set is empty.
- a(n) is the smallest number k such that A073813(k) = prime(n).A073814
a(n) is the smallest number k such that A073813(k) = prime(n).
- Least number x such that gcd(phi(x), sigma(x)) = n.A073815
Least number x such that gcd(phi(x), sigma(x)) = n.
- a(n) = 2^sigma(n) mod n.A073816
a(n) = 2^sigma(n) mod n.
- Tetranacci numbers with different initial conditions: a(n) = a(n-1) + a(n-2) + a(n-3) + a(n-4) starting with a(0)=4, a(1)=1, a(2)=3, a(3)=7.A073817
Tetranacci numbers with different initial conditions: a(n) = a(n-1) + a(n-2) + a(n-3) + a(n-4) starting with a(0)=4, a(1)=1, a(2)=3, a(3)=7.
- a(n) = max(prime(i)*(n+1-i) | 1 <= i <= n).A073818
a(n) = max(prime(i)*(n+1-i) | 1 <= i <= n).
- a(n) = prime(i) such that prime(i)*(n+1-i) is maximized (1 <= i <= n).A073819
a(n) = prime(i) such that prime(i)*(n+1-i) is maximized (1 <= i <= n).
- a(n) = n+1-i such that prime(i)*(n+1-i) is maximized (1 <= i <= n).A073820
a(n) = n+1-i such that prime(i)*(n+1-i) is maximized (1 <= i <= n).
- Decimal expansion of number with continued fraction expansion 0, 2, 4, 6, ... (the even numbers).A073821
Decimal expansion of number with continued fraction expansion 0, 2, 4, 6, ... (the even numbers).
- Decimal expansion of number with continued fraction expansion 0, 1, 1, 2, 3, 5, ... (the Fibonacci numbers).A073822
Decimal expansion of number with continued fraction expansion 0, 1, 1, 2, 3, 5, ... (the Fibonacci numbers).
- Decimal expansion of number with continued fraction expansion 0, 1, 3, 6, 10, ... (the triangular numbers).A073823
Decimal expansion of number with continued fraction expansion 0, 1, 3, 6, 10, ... (the triangular numbers).
- Decimal expansion of number with continued fraction expansion 0, 1, 4, 9, ... (the squares).A073824
Decimal expansion of number with continued fraction expansion 0, 1, 4, 9, ... (the squares).
- Numbers n such that Sum_{k=1..n} k^k is prime.A073825
Numbers n such that Sum_{k=1..n} k^k is prime.
- Primes of the form Sum_{k=1..n} k^k, i.e., primes in A001923.A073826
Primes of the form Sum_{k=1..n} k^k, i.e., primes in A001923.
- Numbers n such that 1 + 0!*1!*2!*...*n! is prime.A073827
Numbers n such that 1 + 0!*1!*2!*...*n! is prime.
- Primes of the form 1 + 0!*1!*2!*...*n! (subsequence of A019515).A073828
Primes of the form 1 + 0!*1!*2!*...*n! (subsequence of A019515).
- a(n) = 4*((n-1)! + 1) + n.A073829
a(n) = 4*((n-1)! + 1) + n.
- a(n) = 4*((n-1)! + 1) + n (mod n*(n + 2)).A073830
a(n) = 4*((n-1)! + 1) + n (mod n*(n + 2)).
- Maximum of A073830(k) for k between A001359(n) and A001359(n+1).A073831
Maximum of A073830(k) for k between A001359(n) and A001359(n+1).
- k between A001359(n) and A001359(n+1) such that A073830(k) is maximal.A073832
k between A001359(n) and A001359(n+1) such that A073830(k) is maximal.
- Numerators of b(n) where b(1) = 1, b(i) = b(i-1) + 1/b(i-1).A073833
Numerators of b(n) where b(1) = 1, b(i) = b(i-1) + 1/b(i-1).
- Denominators of b(n) where b(1) = 1, b(i) = b(i-1) + 1/b(i-1).A073834
Denominators of b(n) where b(1) = 1, b(i) = b(i-1) + 1/b(i-1).
- Replace 10^k with (-10)^k in decimal expansion of n.A073835
Replace 10^k with (-10)^k in decimal expansion of n.
- Let C(n) = product of composite numbers between the n-th prime and (n+1)-th prime; a(n) = floor(C(n+1)/C(n)).A073836
Let C(n) = product of composite numbers between the n-th prime and (n+1)-th prime; a(n) = floor(C(n+1)/C(n)).
- Sum of primes p satisfying n <= p <= 2n.A073837
Sum of primes p satisfying n <= p <= 2n.
- Product of primes p satisfying n <= p <= 2n.A073838
Product of primes p satisfying n <= p <= 2n.
- Sum of the composite numbers between n and 2n (both inclusive).A073839
Sum of the composite numbers between n and 2n (both inclusive).
- Product of the composite numbers between n and 2n (both inclusive).A073840
Product of the composite numbers between n and 2n (both inclusive).
- LCM of the composite numbers between n and 2n (both inclusive).A073841
LCM of the composite numbers between n and 2n (both inclusive).
- a(1) = 1; for n>1, a(n) = the smallest positive integer root of n not included earlier, if such a root exists, otherwise the smallest power of n not included earlier, subject to a(n)<>n.A073842
a(1) = 1; for n>1, a(n) = the smallest positive integer root of n not included earlier, if such a root exists, otherwise the smallest power of n not included earlier, subject to a(n)<>n.
- a(1) = 1; for n > 1 a(n) = smallest number of the form n^r (with r rational != 1) not included earlier.A073843
a(1) = 1; for n > 1 a(n) = smallest number of the form n^r (with r rational != 1) not included earlier.
- a(1) = 1, a(n) = largest prime divisor of A057137(n).A073844
a(1) = 1, a(n) = largest prime divisor of A057137(n).
- a(1)=a(2)=1, a(n+2)=a(n+1)+a(n)+(-2)^n.A073845
a(1)=a(2)=1, a(n+2)=a(n+1)+a(n)+(-2)^n.
- a(1) = 1; thereafter, every even-indexed term is prime and every odd-indexed term is composite.A073846
a(1) = 1; thereafter, every even-indexed term is prime and every odd-indexed term is composite.
- a(0) = 1, c(0) = 1, a(n) for n > 0 is the smallest prime a(n-1) + c(n), where c(n) is composite and larger than c(n-1).A073847
a(0) = 1, c(0) = 1, a(n) for n > 0 is the smallest prime a(n-1) + c(n), where c(n) is composite and larger than c(n-1).
- Smallest of n consecutive numbers in A.P. with a common difference of n with a sum that is an n-th power.A073848
Smallest of n consecutive numbers in A.P. with a common difference of n with a sum that is an n-th power.
- Cumulative sum of initial digits of (n base 3).A073849
Cumulative sum of initial digits of (n base 3).
- Cumulative sum of initial digits of (n base 4).A073850
Cumulative sum of initial digits of (n base 4).
- Cumulative sum of initial digits of (n base 5).A073851
Cumulative sum of initial digits of (n base 5).
- a(1) = 1, then smallest square not included earlier such that every partial sum is a prime.A073852
a(1) = 1, then smallest square not included earlier such that every partial sum is a prime.
- Indices of zeros in A079777.A073853
Indices of zeros in A079777.
- a(1) = 1, a(n) = prime equal to n-th partial sum of A073852.A073854
a(1) = 1, a(n) = prime equal to n-th partial sum of A073852.
- Number of steps to reach 0 starting with n and applying the process x ->bigomega(x), where bigomega = A001222.A073855
Number of steps to reach 0 starting with n and applying the process x ->bigomega(x), where bigomega = A001222.
- a(1) = 1, then the smallest n-th power not included earlier such that each partial sum is a prime.A073856
a(1) = 1, then the smallest n-th power not included earlier such that each partial sum is a prime.
- a(1) = 1, a(n) = prime obtained as a partial sum of A073856.A073857
a(1) = 1, a(n) = prime obtained as a partial sum of A073856.
- Numbers k such that sigma(phi(k)) divides phi(sigma(k)).A073858
Numbers k such that sigma(phi(k)) divides phi(sigma(k)).
- a(1)=1 and a(n>1)=min{primes up to n-1 | a(1)+a(2)+...+a(n-1)+a(n) is a cube}.A073859
a(1)=1 and a(n>1)=min{primes up to n-1 | a(1)+a(2)+...+a(n-1)+a(n) is a cube}.
- Smallest primes such that every partial sum is an n-th power.A073860
Smallest primes such that every partial sum is an n-th power.