Sequences
392,541 sequences
- Largest solution to phi(x) - pi(x) = n or 0 if no such solution exists.A073461
Largest solution to phi(x) - pi(x) = n or 0 if no such solution exists.
- Number of solutions to phi(x) - pi(x) = n.A073462
Number of solutions to phi(x) - pi(x) = n.
- Triangle of number of partitions of 2n into powers of 2 where the largest part is 2^k.A073463
Triangle of number of partitions of 2n into powers of 2 where the largest part is 2^k.
- a(n) = phi(n) mod PrimePi(n).A073464
a(n) = phi(n) mod PrimePi(n).
- Numbers n such that phi(n)/pi(n) is an integer.A073465
Numbers n such that phi(n)/pi(n) is an integer.
- Triangle T(j,k) = remainder when j-th triangular number is divided by k-th triangular number, for 2 < j and 1 < k < j.A073466
Triangle T(j,k) = remainder when j-th triangular number is divided by k-th triangular number, for 2 < j and 1 < k < j.
- a(n) is the number of essentially different ways in which the integers 1,2,3,...,2n can be arranged in a circle such that (1) all pairs of adjacent integers sum to a prime number and (2) all pairs of integers opposite each other on the circle sum to a prime.A073467
a(n) is the number of essentially different ways in which the integers 1,2,3,...,2n can be arranged in a circle such that (1) all pairs of adjacent integers sum to a prime number and (2) all pairs of integers opposite each other on the circle sum to a prime.
- First n-digit prime in the concatenation of the even integers allowing leading zeros.A073468
First n-digit prime in the concatenation of the even integers allowing leading zeros.
- Expansion of x/B(x) where B(x) is the g.f. for A002487.A073469
Expansion of x/B(x) where B(x) is the g.f. for A002487.
- Trisection of A007294.A073470
Trisection of A007294.
- Trisection of A007294.A073471
Trisection of A007294.
- Trisection of A007294.A073472
Trisection of A007294.
- Primes (including 1) forming 3 X 3 magic square with prime entries and minimal constant 111 = A073502(3).A073473
Primes (including 1) forming 3 X 3 magic square with prime entries and minimal constant 111 = A073502(3).
- Triangle T(n,k) read by rows, where o.g.f. for T(n,k) is n!*Sum_{k=0..n} (1+x)^(n-k)/k!.A073474
Triangle T(n,k) read by rows, where o.g.f. for T(n,k) is n!*Sum_{k=0..n} (1+x)^(n-k)/k!.
- Rearrangement of factorial numbers such that a(k) + a(k+1) - 1 is a prime for all k.A073475
Rearrangement of factorial numbers such that a(k) + a(k+1) - 1 is a prime for all k.
- Numbers k such that k^4 + 1, (k+2)^4 + 1 and (k+4)^4 + 1 are all primes.A073476
Numbers k such that k^4 + 1, (k+2)^4 + 1 and (k+4)^4 + 1 are all primes.
- Least k such that 2^n = k^2-sigma(k)*phi(k).A073477
Least k such that 2^n = k^2-sigma(k)*phi(k).
- Expansion of (1+x)^(1/(1-x)).A073478
Expansion of (1+x)^(1/(1-x)).
- Expansion of e.g.f.: (1-x)^(-1-x).A073479
Expansion of e.g.f.: (1-x)^(-1-x).
- Triangle T(n,k) read by rows, where e.g.f. for T(n,k) is exp(x*y)*log(1+x)/(1-x).A073480
Triangle T(n,k) read by rows, where e.g.f. for T(n,k) is exp(x*y)*log(1+x)/(1-x).
- Least prime factor of the n-th squarefree number.A073481
Least prime factor of the n-th squarefree number.
- Largest prime factor of the n-th squarefree number.A073482
Largest prime factor of the n-th squarefree number.
- For the n-th squarefree number: the product of all primes greater than its smallest factor and less than its largest factor and not dividing it.A073483
For the n-th squarefree number: the product of all primes greater than its smallest factor and less than its largest factor and not dividing it.
- Number of gaps in factors of the n-th squarefree number.A073484
Number of gaps in factors of the n-th squarefree number.
- Product of any number of consecutive primes; squarefree numbers with no gaps in their prime factorization.A073485
Product of any number of consecutive primes; squarefree numbers with no gaps in their prime factorization.
- Squarefree numbers having at least one prime gap.A073486
Squarefree numbers having at least one prime gap.
- Squarefree numbers having exactly one prime gap.A073487
Squarefree numbers having exactly one prime gap.
- Squarefree numbers having exactly two prime gaps.A073488
Squarefree numbers having exactly two prime gaps.
- Squarefree numbers having exactly three prime gaps.A073489
Squarefree numbers having exactly three prime gaps.
- Number of prime gaps in factorization of n.A073490
Number of prime gaps in factorization of n.
- Numbers having no prime gaps in their factorization.A073491
Numbers having no prime gaps in their factorization.
- Numbers having at least one prime gap in their factorization.A073492
Numbers having at least one prime gap in their factorization.
- Numbers having exactly one prime gap in their factorization.A073493
Numbers having exactly one prime gap in their factorization.
- Numbers having exactly two prime gaps in their factorization.A073494
Numbers having exactly two prime gaps in their factorization.
- Numbers having exactly three prime gaps in their factorization.A073495
Numbers having exactly three prime gaps in their factorization.
- Expansion of (3 + 2*x + 3*x^2)/(1 + x + 3*x^2 - x^3).A073496
Expansion of (3 + 2*x + 3*x^2)/(1 + x + 3*x^2 - x^3).
- a(n) = n^2 - prime(n).A073497
a(n) = n^2 - prime(n).
- Binomial transform of A073145.A073498
Binomial transform of A073145.
- Numbers k such that k^(k+1) + (k+1)^k is prime.A073499
Numbers k such that k^(k+1) + (k+1)^k is prime.
- Numbers k such that sigma(k) = sigma(k+1)+sigma(k-1).A073500
Numbers k such that sigma(k) = sigma(k+1)+sigma(k-1).
- Primes p such that the largest prime factor of p^2+1 is less than p.A073501
Primes p such that the largest prime factor of p^2+1 is less than p.
- The smallest magic constant for n X n magic square with prime entries (regarding 1 as a prime).A073502
The smallest magic constant for n X n magic square with prime entries (regarding 1 as a prime).
- Numbers n such that the number of solutions to x^4 == 1 (mod n) is twice the number of solutions of x^2 == 1 (mod n).A073503
Numbers n such that the number of solutions to x^4 == 1 (mod n) is twice the number of solutions of x^2 == 1 (mod n).
- A possible basis for finite fractal sequences: let u(1) = 1, u(2) = n, u(k) = floor(u(k-1)/2) + floor(u(k-2)/2); then a(n) = lim_{k->infinity} u(k).A073504
A possible basis for finite fractal sequences: let u(1) = 1, u(2) = n, u(k) = floor(u(k-1)/2) + floor(u(k-2)/2); then a(n) = lim_{k->infinity} u(k).
- Number of primes == 1 (mod 10) less than 10^n.A073505
Number of primes == 1 (mod 10) less than 10^n.
- Number of primes == 3 (mod 10) less than 10^n.A073506
Number of primes == 3 (mod 10) less than 10^n.
- Number of primes == 7 (mod 10) less than 10^n.A073507
Number of primes == 7 (mod 10) less than 10^n.
- Number of primes == 9 (mod 10) less than 10^n.A073508
Number of primes == 9 (mod 10) less than 10^n.
- Number of primes less than 10^n with initial digit 9.A073509
Number of primes less than 10^n with initial digit 9.
- Number of primes less than 10^n with initial digit 8.A073510
Number of primes less than 10^n with initial digit 8.