Sequences
392,541 sequences
- Greatest common prime divisor of n and phi(n)=A000010(n); a(n)=1 if no common prime divisor exists.A082061
Greatest common prime divisor of n and phi(n)=A000010(n); a(n)=1 if no common prime divisor exists.
- Greatest common prime-divisor of n and sigma(n)=A000203(n); a(n)=1 if no common prime-divisor exists.A082062
Greatest common prime-divisor of n and sigma(n)=A000203(n); a(n)=1 if no common prime-divisor exists.
- Greatest common prime divisor of n and sigma_2(n) = A001157(n), or 1 if the two are relatively prime.A082063
Greatest common prime divisor of n and sigma_2(n) = A001157(n), or 1 if the two are relatively prime.
- Greatest common prime-divisor of phi(n) and sigma(n) = A000203(n); a(n)=1 if no common prime-divisor exists.A082064
Greatest common prime-divisor of phi(n) and sigma(n) = A000203(n); a(n)=1 if no common prime-divisor exists.
- Greatest common prime-divisor of phi(n)=A000010(n) and sigma(2,n) = A001157(n); a(n) = 1 if no common prime-divisor exists.A082065
Greatest common prime-divisor of phi(n)=A000010(n) and sigma(2,n) = A001157(n); a(n) = 1 if no common prime-divisor exists.
- Greatest common prime-divisor of sigma_1(n)=A000203(n) and sigma_2(n)=A001157(n); a(n)=1 if no common prime-divisor exists.A082066
Greatest common prime-divisor of sigma_1(n)=A000203(n) and sigma_2(n)=A001157(n); a(n)=1 if no common prime-divisor exists.
- Smallest prime that divides n and phi(n)=A000010(n), or 1 if n and phi(n) are relatively prime.A082067
Smallest prime that divides n and phi(n)=A000010(n), or 1 if n and phi(n) are relatively prime.
- Smallest common prime-divisor of n and sigma(n) = A000203(n); a(n)=1 if no common prime-divisor exists.A082068
Smallest common prime-divisor of n and sigma(n) = A000203(n); a(n)=1 if no common prime-divisor exists.
- Smallest common prime-divisor of n and Sigma_2(n) = A001157(n); a(n) = 1 if no common prime-divisor exists.A082069
Smallest common prime-divisor of n and Sigma_2(n) = A001157(n); a(n) = 1 if no common prime-divisor exists.
- Smallest prime that divides phi(n) and sigma(n) = A000203(n), or 1 if phi(n) and sigma(n) are relatively prime.A082070
Smallest prime that divides phi(n) and sigma(n) = A000203(n), or 1 if phi(n) and sigma(n) are relatively prime.
- Smallest common prime-divisor of phi(n) = A000010(n) and sigma_2(n) = A001157(n); a(n)=1 if no common prime-divisor exists.A082071
Smallest common prime-divisor of phi(n) = A000010(n) and sigma_2(n) = A001157(n); a(n)=1 if no common prime-divisor exists.
- Smallest prime that divides sigma(n) = A000203(n) and sigma_2(n) = A001157(n), or 1 if sigma(n) and sigma_2(n) are relatively prime.A082072
Smallest prime that divides sigma(n) = A000203(n) and sigma_2(n) = A001157(n), or 1 if sigma(n) and sigma_2(n) are relatively prime.
- First difference set of primes with 4k+1 form: A002144.A082073
First difference set of primes with 4k+1 form: A002144.
- One quarter of first differences of primes of the form 4*k+1 (A002144).A082074
One quarter of first differences of primes of the form 4*k+1 (A002144).
- First differences of primes of the form 4*k+3 (A002145).A082075
First differences of primes of the form 4*k+3 (A002145).
- First differences of primes of the form 4*k+3 (A002145), divided by 4.A082076
First differences of primes of the form 4*k+3 (A002145), divided by 4.
- Balanced primes of order two.A082077
Balanced primes of order two.
- Balanced primes of order three.A082078
Balanced primes of order three.
- Balanced primes of order four.A082079
Balanced primes of order four.
- Smallest balanced prime of order n.A082080
Smallest balanced prime of order n.
- a(n) = fixed point reached when the pseudo-log function A008475 is iterated starting from n.A082081
a(n) = fixed point reached when the pseudo-log function A008475 is iterated starting from n.
- Number of steps to reach 1 in the process of expanding the interval (i1,i2) successively to right and left, such that i1 and i2 always stay coprime, starting with (n,n).A082082
Number of steps to reach 1 in the process of expanding the interval (i1,i2) successively to right and left, such that i1 and i2 always stay coprime, starting with (n,n).
- a(n) = A082081(n!) = A082081(A000142(n)); fixed points of iterated A008475 function initiated at factorials as initial values.A082083
a(n) = A082081(n!) = A082081(A000142(n)); fixed points of iterated A008475 function initiated at factorials as initial values.
- a(n) = A029908(n!) = A029908(A000142(n)); fixed points of iterated A001414 function if started at factorials as initial values.A082084
a(n) = A029908(n!) = A029908(A000142(n)); fixed points of iterated A001414 function if started at factorials as initial values.
- Fixed points when A008475 is iterated started at factorials of prime numbers.A082085
Fixed points when A008475 is iterated started at factorials of prime numbers.
- Fixed points when A001414 is iterated and started at factorials of prime numbers.A082086
Fixed points when A001414 is iterated and started at factorials of prime numbers.
- a(n) is the fixed point if function A008472 is iterated when started at initial value n!.A082087
a(n) is the fixed point if function A008472 is iterated when started at initial value n!.
- a(n) is the fixed point if function A008472 is iterated when started at initial value prime[n]!.A082088
a(n) is the fixed point if function A008472 is iterated when started at initial value prime[n]!.
- a(n)-th prime is the fixed point if function A008472 is iterated when started at factorial of n-th prime.A082089
a(n)-th prime is the fixed point if function A008472 is iterated when started at factorial of n-th prime.
- Length of iteration sequence if function A056239, a pseudo-logarithm is iterated and started at n. Fixed point equals zero for all initial values.A082090
Length of iteration sequence if function A056239, a pseudo-logarithm is iterated and started at n. Fixed point equals zero for all initial values.
- a(n) = one more than the number of iterations of A005361 needed to reach 1 from the starting value n.A082091
a(n) = one more than the number of iterations of A005361 needed to reach 1 from the starting value n.
- Composite k such that d(k) < d(sigma(k)), i.e., A000005(k) < A000005(A000203(k)).A082092
Composite k such that d(k) < d(sigma(k)), i.e., A000005(k) < A000005(A000203(k)).
- a(n) is the least number m such that (m+n)!/m! = (m+1)*(m+2)*...*(m+n) divides lcm(1,...,m).A082093
a(n) is the least number m such that (m+n)!/m! = (m+1)*(m+2)*...*(m+n) divides lcm(1,...,m).
- A 2nd-order recursion: a(1)=a(2)=1; a(n) = prime(a(n-1)) + primepi(a(n-2)) = A000040(a(n-1)) + A000720(a(n-2)).A082094
A 2nd-order recursion: a(1)=a(2)=1; a(n) = prime(a(n-1)) + primepi(a(n-2)) = A000040(a(n-1)) + A000720(a(n-2)).
- A 2nd order recursion: a(1)=a(2)=1, a(n) = prime(a(n-2)) + pi(a(n-1)) = A000040(a(n-2)) + A000720(a(n-1)).A082095
A 2nd order recursion: a(1)=a(2)=1, a(n) = prime(a(n-2)) + pi(a(n-1)) = A000040(a(n-2)) + A000720(a(n-1)).
- A 2nd order recursion: a(1)=a(2)=1; a(n) = prime(a(n-2)+a(n-1)) = A000040(a(n-2)+a(n-1)).A082096
A 2nd order recursion: a(1)=a(2)=1; a(n) = prime(a(n-2)+a(n-1)) = A000040(a(n-2)+a(n-1)).
- a(n) = d(a(n-1)) + n = A000005(a(n-1)) + n, with a(1)=1.A082097
a(n) = d(a(n-1)) + n = A000005(a(n-1)) + n, with a(1)=1.
- a(n) is the smallest prime p of the form 4k+3 such that nextprime(p) - p = 4n.A082098
a(n) is the smallest prime p of the form 4k+3 such that nextprime(p) - p = 4n.
- a(n) is the smallest prime p of the form 4k+1 such that nextprime(p) - p = 4n.A082099
a(n) is the smallest prime p of the form 4k+1 such that nextprime(p) - p = 4n.
- a(n) = A001157(A002110(n)), sum of squares of divisors of primorial numbers.A082100
a(n) = A001157(A002110(n)), sum of squares of divisors of primorial numbers.
- Primes of form 2^k + 3^k.A082101
Primes of form 2^k + 3^k.
- Primes of the form 2^(k-1) + 3^k.A082102
Primes of the form 2^(k-1) + 3^k.
- Numbers n such that 3^n + 2^(n-1) is prime.A082103
Numbers n such that 3^n + 2^(n-1) is prime.
- Number of distinct characteristic polynomials among all simple undirected graphs on n nodes.A082104
Number of distinct characteristic polynomials among all simple undirected graphs on n nodes.
- Array A(n, k) = (k*n)^2 + 4*(k*n) + 1, read by antidiagonals.A082105
Array A(n, k) = (k*n)^2 + 4*(k*n) + 1, read by antidiagonals.
- Main diagonal of number array A082105.A082106
Main diagonal of number array A082105.
- Diagonal sums of number array A082105.A082107
Diagonal sums of number array A082105.
- a(n) = 4*n^2 + 6*n + 1.A082108
a(n) = 4*n^2 + 6*n + 1.
- Third row of number array A082105.A082109
Third row of number array A082105.
- Array A(n,k) = (k*n)^2 + 5*(k*n) + 1, read by antidiagonals.A082110
Array A(n,k) = (k*n)^2 + 5*(k*n) + 1, read by antidiagonals.