Sequences
392,541 sequences
- a[n] is the 5th term in Euclid-Mullin (EM) prime sequence initiated with n-th prime.A094461
a[n] is the 5th term in Euclid-Mullin (EM) prime sequence initiated with n-th prime.
- a(n) is the 6th term in Euclid-Mullin (EM) prime sequence initiated with n-th prime.A094462
a(n) is the 6th term in Euclid-Mullin (EM) prime sequence initiated with n-th prime.
- a(n) is the 7th term in Euclid-Mullin (EM) prime sequence initiated with n-th prime.A094463
a(n) is the 7th term in Euclid-Mullin (EM) prime sequence initiated with n-th prime.
- Least initial value for a Euclid/Mullin sequence whose 3rd term (= least prime divisor of 1+2p) equals the n-th prime. prime(1)=2 is never a third term, so offset=2.A094464
Least initial value for a Euclid/Mullin sequence whose 3rd term (= least prime divisor of 1+2p) equals the n-th prime. prime(1)=2 is never a third term, so offset=2.
- Least initial value for an Euclid/Mullin sequence whose 4th term is prime(n). prime(1)=2 is never a fourth term, so offset=2.A094465
Least initial value for an Euclid/Mullin sequence whose 4th term is prime(n). prime(1)=2 is never a fourth term, so offset=2.
- a[n] is the smallest integer with property that phi[n+a[n]]=sigma[n].A094466
a[n] is the smallest integer with property that phi[n+a[n]]=sigma[n].
- Primes of the form -1+multiply perfect numbers.A094467
Primes of the form -1+multiply perfect numbers.
- Numbers k such that sum of 9th powers of divisors of k is divisible by the square of Euler-phi of k.A094468
Numbers k such that sum of 9th powers of divisors of k is divisible by the square of Euler-phi of k.
- Numbers k such that sum of 11th powers of divisors of k is divisible by the square of Euler-phi of k.A094469
Numbers k such that sum of 11th powers of divisors of k is divisible by the square of Euler-phi of k.
- Numbers k such that phi(k) | sigma_18(k).A094470
Numbers k such that phi(k) | sigma_18(k).
- a(n) = Sum_{(n - k)|n, 0 <= k <= n} k.A094471
a(n) = Sum_{(n - k)|n, 0 <= k <= n} k.
- a(n) = n*tau(n) - sigma(n) - phi(n), where tau(n) is the number of divisors of n.A094472
a(n) = n*tau(n) - sigma(n) - phi(n), where tau(n) is the number of divisors of n.
- Smallest prime factor of 2^n+3^n.A094473
Smallest prime factor of 2^n+3^n.
- a(n) is the largest prime factor of 2^n + 3^n.A094474
a(n) is the largest prime factor of 2^n + 3^n.
- Primes of form 2^n + 5^n.A094475
Primes of form 2^n + 5^n.
- Primes of form 2^j + 17^j.A094476
Primes of form 2^j + 17^j.
- Primes of form 2^n + 37^n.A094477
Primes of form 2^n + 37^n.
- Primes of form 2^j + 59^j.A094478
Primes of form 2^j + 59^j.
- Primes of the form p^4 + 16 where p is also a prime.A094479
Primes of the form p^4 + 16 where p is also a prime.
- Unhappy primes, primes that are also unhappy numbers.A094480
Unhappy primes, primes that are also unhappy numbers.
- Duplicate of A045637.A094481
Duplicate of A045637.
- Primes of form 2^j + 137^j.A094482
Primes of form 2^j + 137^j.
- Primes of form 2^j + 179^j.A094483
Primes of form 2^j + 179^j.
- Primes of form 2^j + 461^j.A094484
Primes of form 2^j + 461^j.
- T(n, k) = Stirling1(n+1, k) - Stirling1(n, k-1), for 1 <= k <= n. Triangle read by rows.A094485
T(n, k) = Stirling1(n+1, k) - Stirling1(n, k-1), for 1 <= k <= n. Triangle read by rows.
- Primes of form 2^j + 223^j.A094486
Primes of form 2^j + 223^j.
- Primes p such that 2^j+p^j are primes for j=0,1,2,4.A094487
Primes p such that 2^j+p^j are primes for j=0,1,2,4.
- Primes p such that 2^j+p^j are primes for j=0,1,2,8.A094488
Primes p such that 2^j+p^j are primes for j=0,1,2,8.
- Primes p such that 2^j+p^j are primes for j=0,1,4,32.A094489
Primes p such that 2^j+p^j are primes for j=0,1,4,32.
- Primes p such that 2^j+p^j are primes for j=0,2,4,64.A094490
Primes p such that 2^j+p^j are primes for j=0,2,4,64.
- Primes p such that 2^j+p^j are primes for j=0,4,8,128.A094491
Primes p such that 2^j+p^j are primes for j=0,4,8,128.
- Primes p such that 2^j+p^j are primes for j=0,1,4,16.A094492
Primes p such that 2^j+p^j are primes for j=0,1,4,16.
- Primes p such that 2^j+p^j are primes for j=0,1,2,16.A094493
Primes p such that 2^j+p^j are primes for j=0,1,2,16.
- Primes p such that 2^j+p^j are primes for j=0,2,4,8.A094494
Primes p such that 2^j+p^j are primes for j=0,2,4,8.
- Table of binomial coefficients mod m^2, read by rows: T(m, n) = binomial(m, n) mod m^2.A094495
Table of binomial coefficients mod m^2, read by rows: T(m, n) = binomial(m, n) mod m^2.
- Triangle read by rows: T(n,k) = binomial(n,k) - binomial(n,k) mod n^2, with T(0,0) = 1.A094496
Triangle read by rows: T(n,k) = binomial(n,k) - binomial(n,k) mod n^2, with T(0,0) = 1.
- Triangular table A(n,j) = C(n,j) - C(n,j) mod n^3, difference of binomial coefficient and its residue mod n^3, read by rows.A094497
Triangular table A(n,j) = C(n,j) - C(n,j) mod n^3, difference of binomial coefficient and its residue mod n^3, read by rows.
- Least prime factor of 2^(4*n) + 3^(4*n) = 16^n + 81^n.A094498
Least prime factor of 2^(4*n) + 3^(4*n) = 16^n + 81^n.
- Smallest prime factor of 2^(2^n)+3^(2^n), i.e., exponents are powers of 2.A094499
Smallest prime factor of 2^(2^n)+3^(2^n), i.e., exponents are powers of 2.
- Least number k such that (n+1)^k / n^k >= 2.A094500
Least number k such that (n+1)^k / n^k >= 2.
- Smallest number that requires n iterations of the sum of digits of the divisors (A034690) to reach 15.A094501
Smallest number that requires n iterations of the sum of digits of the divisors (A034690) to reach 15.
- a(n) = A000203(A046528(n)): sigma of those numbers whose sigma is a power of 2, in order of appearance.A094502
a(n) = A000203(A046528(n)): sigma of those numbers whose sigma is a power of 2, in order of appearance.
- Triangle read by rows: coefficients d(n,k) of André polynomials D(x,n) = Sum_{k>0} d(n,k)*x^k.A094503
Triangle read by rows: coefficients d(n,k) of André polynomials D(x,n) = Sum_{k>0} d(n,k)*x^k.
- T(n,m) equals number of solid partitions of n containing m plane partitions.A094504
T(n,m) equals number of solid partitions of n containing m plane partitions.
- Powers of 2 which are not the sum of divisors of any other number. Powers of 2 present in A007369.A094505
Powers of 2 which are not the sum of divisors of any other number. Powers of 2 present in A007369.
- Numerator of I(n) = (-1) * Integral_{x=0..4^n} (1-x^(3/2)) dx.A094506
Numerator of I(n) = (-1) * Integral_{x=0..4^n} (1-x^(3/2)) dx.
- Triangle read by rows: T(n,k) is number of Dyck paths of semilength n and having k UDUD's (here U=(1,1), D=(1,-1)).A094507
Triangle read by rows: T(n,k) is number of Dyck paths of semilength n and having k UDUD's (here U=(1,1), D=(1,-1)).
- Triangle read by rows: T[n,m] = number of solid partitions of n with trace m, where the trace of a solid partitions is defined as the sum of the traces of the constituent plane partitions.A094508
Triangle read by rows: T[n,m] = number of solid partitions of n with trace m, where the trace of a solid partitions is defined as the sum of the traces of the constituent plane partitions.
- Numbers which are numerators of at least one reduced rational sum{k=1 to m} 1/k^n, taken over all positive integers m and n.A094509
Numbers which are numerators of at least one reduced rational sum{k=1 to m} 1/k^n, taken over all positive integers m and n.
- Smallest number distinct from n, not occurring earlier and having in binary representation exactly as many ones as n.A094510
Smallest number distinct from n, not occurring earlier and having in binary representation exactly as many ones as n.