Sequences
392,541 sequences
- Numbers with no middle divisors (cf. A071090).A071561
Numbers with no middle divisors (cf. A071090).
- Numbers n such that the sum of the middle divisors of n (A071090) is not zero.A071562
Numbers n such that the sum of the middle divisors of n (A071090) is not zero.
- Least k such that there are no middle divisors of k (A071090) through k+n.A071563
Least k such that there are no middle divisors of k (A071090) through k+n.
- Smallest k such that n^8+k^8, n^4+k^4, n^2+k^2, n+k are simultaneously prime.A071564
Smallest k such that n^8+k^8, n^4+k^4, n^2+k^2, n+k are simultaneously prime.
- Numbers k such that x^k + x^(k-1) + x^(k-2) + ... + x + 1 is irreducible over GF(7).A071565
Numbers k such that x^k + x^(k-1) + x^(k-2) + ... + x + 1 is irreducible over GF(7).
- Numbers k such that x^k + x^(k-1) + x^(k-2) + ... + x + 1 is irreducible over GF(11).A071566
Numbers k such that x^k + x^(k-1) + x^(k-2) + ... + x + 1 is irreducible over GF(11).
- Smallest k>n such that n^2+n+1 divides k^2+k+1.A071567
Smallest k>n such that n^2+n+1 divides k^2+k+1.
- Smallest k>n such that n^3+1 divides k*n^2+1.A071568
Smallest k>n such that n^3+1 divides k*n^2+1.
- Det(M_n) where M_n is the n X n matrix m(i,j)=1 if floor(i/j) is even, 0 otherwise.A071569
Det(M_n) where M_n is the n X n matrix m(i,j)=1 if floor(i/j) is even, 0 otherwise.
- a(n) = 2 * Sum_{d|n} 2^mu(d).A071570
a(n) = 2 * Sum_{d|n} 2^mu(d).
- Smallest number whose square has exactly 2n+1 divisors.A071571
Smallest number whose square has exactly 2n+1 divisors.
- Least k such that nextprime(k*prime(n)) - k*prime(n) is nonprime.A071572
Least k such that nextprime(k*prime(n)) - k*prime(n) is nonprime.
- a(1) = 1; a(n) = a(n-1)-th nontotient number.A071573
a(1) = 1; a(n) = a(n-1)-th nontotient number.
- If n = k-th prime, a(n) = 2*a(k) + 1; if n = k-th nonprime, a(n) = 2*a(k).A071574
If n = k-th prime, a(n) = 2*a(k) + 1; if n = k-th nonprime, a(n) = 2*a(k).
- Number of iterations of cototient(n) needed to reach 1 (cototient(n) = n-phi(n)).A071575
Number of iterations of cototient(n) needed to reach 1 (cototient(n) = n-phi(n)).
- a(n) = least k such that 2ik + 1 is prime for all 1 <= i <= n.A071576
a(n) = least k such that 2ik + 1 is prime for all 1 <= i <= n.
- Smallest k such that 2ik+1 is squarefree for 1<=i<=n.A071577
Smallest k such that 2ik+1 is squarefree for 1<=i<=n.
- Number of iterations of Pi(n) needed to reach 1, where Pi(x) denotes the number of primes <= x.A071578
Number of iterations of Pi(n) needed to reach 1, where Pi(x) denotes the number of primes <= x.
- a(n) = 2*a(n-1)*A002812(n-1), starting a(0)=1.A071579
a(n) = 2*a(n-1)*A002812(n-1), starting a(0)=1.
- Smallest prime of the form k*a(n-1)*a(n-2)*...*a(1)+1.A071580
Smallest prime of the form k*a(n-1)*a(n-2)*...*a(1)+1.
- A003656(n)-prime(n).A071581
A003656(n)-prime(n).
- Powers of 4 written backwards.A071582
Powers of 4 written backwards.
- Powers of 5 written backwards.A071583
Powers of 5 written backwards.
- Powers of 7 written backwards.A071584
Powers of 7 written backwards.
- Numerator of the continued fraction expansion whose terms are the first-order differences of exponents in the binary representation of 4*n, with the exponents of 2 being listed in descending order.A071585
Numerator of the continued fraction expansion whose terms are the first-order differences of exponents in the binary representation of 4*n, with the exponents of 2 being listed in descending order.
- Powers of 8 written backwards.A071586
Powers of 8 written backwards.
- Powers of 9 written backwards.A071587
Powers of 9 written backwards.
- Powers of 6 written backwards.A071588
Powers of 6 written backwards.
- Numbers n such that Reversal(n) > n.A071589
Numbers n such that Reversal(n) > n.
- Numbers k such that reversal(k) < k.A071590
Numbers k such that reversal(k) < k.
- Numbers m such that Reversal(m) is squarefree.A071591
Numbers m such that Reversal(m) is squarefree.
- Numbers m such that Reversal(m) is not squarefree.A071592
Numbers m such that Reversal(m) is not squarefree.
- Number of 1's in binary representation of n equals tau(n), the number of divisors of n.A071593
Number of 1's in binary representation of n equals tau(n), the number of divisors of n.
- Numbers k such that the number of 1's in the binary representation of k equals omega(k), the number of distinct primes in the factorization of k.A071594
Numbers k such that the number of 1's in the binary representation of k equals omega(k), the number of distinct primes in the factorization of k.
- Odd numbers k such that the number of 1's in binary representation of k equals omega(k), the number of distinct primes in the factorization of k.A071595
Odd numbers k such that the number of 1's in binary representation of k equals omega(k), the number of distinct primes in the factorization of k.
- Even numbers k such that the number of 1's in binary representation of k equals omega(k), the number of distinct primes in the factorization of k.A071596
Even numbers k such that the number of 1's in binary representation of k equals omega(k), the number of distinct primes in the factorization of k.
- Sum of elements in the simple continued fraction for (1+1/n)^n.A071597
Sum of elements in the simple continued fraction for (1+1/n)^n.
- a(0) = 1; a(n) = half of the a(n-1)-th even nontotient number.A071598
a(0) = 1; a(n) = half of the a(n-1)-th even nontotient number.
- Product of elements in the simple continued fraction for (1+1/n)^n.A071599
Product of elements in the simple continued fraction for (1+1/n)^n.
- Numbers k such that k and prime(k) have the same number of 1's in their binary representation.A071600
Numbers k such that k and prime(k) have the same number of 1's in their binary representation.
- Numbers k such that k and phi(k) have the same number of 1's in their binary representation.A071601
Numbers k such that k and phi(k) have the same number of 1's in their binary representation.
- Sum of the reverses of the first n primes.A071602
Sum of the reverses of the first n primes.
- Number of different positive integers that we can obtain from the integers {1,2,...,n} using each number at most once and the operators +, -, *, /, where intermediate subexpressions must be integers.A071603
Number of different positive integers that we can obtain from the integers {1,2,...,n} using each number at most once and the operators +, -, *, /, where intermediate subexpressions must be integers.
- a(n) is the number of 7-smooth numbers <= n.A071604
a(n) is the number of 7-smooth numbers <= n.
- Number of ordered pairs (a,b) of elements of the symmetric group S_n such that the pair a,b generates S_n.A071605
Number of ordered pairs (a,b) of elements of the symmetric group S_n such that the pair a,b generates S_n.
- Smallest zero-free palindromic prime of 2n + 1 digits.A071606
Smallest zero-free palindromic prime of 2n + 1 digits.
- Number of strong complete mappings of the cyclic group Z_{2n+1}.A071607
Number of strong complete mappings of the cyclic group Z_{2n+1}.
- Number of complete mappings f(x) of Z_{2n+1} such that -(-id+f)^(-1)=f.A071608
Number of complete mappings f(x) of Z_{2n+1} such that -(-id+f)^(-1)=f.
- Squared radii of the spheres around (0,0,0) that contain record numbers of lattice points.A071609
Squared radii of the spheres around (0,0,0) that contain record numbers of lattice points.
- Integer radii of the spheres around (0,0,0) that contain record numbers of lattice points.A071610
Integer radii of the spheres around (0,0,0) that contain record numbers of lattice points.