Sequences
392,541 sequences
- Larger of a pair (p,q) of primes with (p+q)/2=prime(n)# and q-p is minimal.A094711
Larger of a pair (p,q) of primes with (p+q)/2=prime(n)# and q-p is minimal.
- Primes that are not the sum of three positive squares.A094712
Primes that are not the sum of three positive squares.
- Number of ways that prime(n) can be represented as a^2+b^2+c^2 with c >= b >= a > 0.A094713
Number of ways that prime(n) can be represented as a^2+b^2+c^2 with c >= b >= a > 0.
- Smallest prime having exactly n representations as a^2+b^2+c^2 with c >= b >= a > 0.A094714
Smallest prime having exactly n representations as a^2+b^2+c^2 with c >= b >= a > 0.
- a(n) = Sum_{2*i+3*j=n, 0<=i<=n, 0<=j<=n} n!/( (2*i)!*(3*j)! ).A094715
a(n) = Sum_{2*i+3*j=n, 0<=i<=n, 0<=j<=n} n!/( (2*i)!*(3*j)! ).
- Largest value in trajectory of n under the juggler map of A094683.A094716
Largest value in trajectory of n under the juggler map of A094683.
- a(n) = n! * Sum_{i+2j+3k=n} 1/(i!*(2j)!*(3k)!).A094717
a(n) = n! * Sum_{i+2j+3k=n} 1/(i!*(2j)!*(3k)!).
- Array T read by antidiagonals: T(n,k) is the number of involutions avoiding 132 and 12...k.A094718
Array T read by antidiagonals: T(n,k) is the number of involutions avoiding 132 and 12...k.
- Sum[k=1..n, T(k,n-k+1)], where T is array A094718.A094719
Sum[k=1..n, T(k,n-k+1)], where T is array A094718.
- Fill's first logarithmic constant.A094720
Fill's first logarithmic constant.
- Fill's second logarithmic constant.A094721
Fill's second logarithmic constant.
- Primes p whose order of primeness A078442(p) is at least 13.A094722
Primes p whose order of primeness A078442(p) is at least 13.
- a(n) = Pell(n+2) - 2^n.A094723
a(n) = Pell(n+2) - 2^n.
- Decimal expansion of Sum(1/c^c) where c is nonprime.A094724
Decimal expansion of Sum(1/c^c) where c is nonprime.
- Largest value in trajectory of n under the modified juggler map of A094685.A094725
Largest value in trajectory of n under the modified juggler map of A094685.
- Let M = the 2 X 2 matrix [ 0 3 / 3 2]. Take (M^n * [1 1])/3 = [p q]; then a(n) = p.A094726
Let M = the 2 X 2 matrix [ 0 3 / 3 2]. Take (M^n * [1 1])/3 = [p q]; then a(n) = p.
- Triangle read by rows: T(n,k) = n + k, 0 <= k < n, n >= 1.A094727
Triangle read by rows: T(n,k) = n + k, 0 <= k < n, n >= 1.
- Triangle read by rows: T(n,k) = n^2 - k^2, 0 <= k < n.A094728
Triangle read by rows: T(n,k) = n^2 - k^2, 0 <= k < n.
- Number of connected ordered 2-element multiantichains on a labeled n-set.A094729
Number of connected ordered 2-element multiantichains on a labeled n-set.
- Number of connected ordered 3-element multiantichains on a labeled n-set.A094730
Number of connected ordered 3-element multiantichains on a labeled n-set.
- Number of connected ordered 4-element multiantichains on a labeled n-set.A094731
Number of connected ordered 4-element multiantichains on a labeled n-set.
- Number of connected ordered 5-element multiantichains on a labeled n-set.A094732
Number of connected ordered 5-element multiantichains on a labeled n-set.
- Number of connected ordered 6-element multiantichains on a labeled n-set.A094733
Number of connected ordered 6-element multiantichains on a labeled n-set.
- Number of connected 2-element multiantichains on a labeled n-set.A094734
Number of connected 2-element multiantichains on a labeled n-set.
- Number of connected 3-element multiantichains on a labeled n-set.A094735
Number of connected 3-element multiantichains on a labeled n-set.
- Number of connected 4-element multiantichains on a labeled n-set.A094736
Number of connected 4-element multiantichains on a labeled n-set.
- Number of connected 5-element multiantichains on a labeled n-set.A094737
Number of connected 5-element multiantichains on a labeled n-set.
- Number of connected 6-element multiantichains on a labeled n-set.A094738
Number of connected 6-element multiantichains on a labeled n-set.
- Numbers m such that 4^k*m, for integer k >= 0, are numbers having a unique partition into three squares.A094739
Numbers m such that 4^k*m, for integer k >= 0, are numbers having a unique partition into three squares.
- Numbers n such that 4^k n, for k >= 0, are numbers having a unique partition into three positive squares.A094740
Numbers n such that 4^k n, for k >= 0, are numbers having a unique partition into three positive squares.
- Number of primes of the form k+1 where k is coprime to n, k < n.A094741
Number of primes of the form k+1 where k is coprime to n, k < n.
- Duplicate of A008578.A094742
Duplicate of A008578.
- Beginning with 2, increasing primes such that the sum of successive differences is also prime.A094743
Beginning with 2, increasing primes such that the sum of successive differences is also prime.
- Rearrangement of primes so that sum of the absolute value of the successive differences is also a prime.A094744
Rearrangement of primes so that sum of the absolute value of the successive differences is also a prime.
- Primes arising as the partial sums of the successive differences in A094744.A094745
Primes arising as the partial sums of the successive differences in A094744.
- Primes arising as successive differences in A093903.A094746
Primes arising as successive differences in A093903.
- Rearrangement of odd primes so that absolute successive differences are the least distinct even numbers. Priority is given to the least successive difference that has not occurred earlier.A094747
Rearrangement of odd primes so that absolute successive differences are the least distinct even numbers. Priority is given to the least successive difference that has not occurred earlier.
- Successive differences arising in A094747.A094748
Successive differences arising in A094747.
- Triangle read by rows in which the n-th row contains the least set of n successive primes whose successive difference forms an arithmetic progression with common difference 2, (successive even numbers).A094749
Triangle read by rows in which the n-th row contains the least set of n successive primes whose successive difference forms an arithmetic progression with common difference 2, (successive even numbers).
- Rearrangement of composite numbers so that the successive differences are distinct prime numbers. Priority is given to the least successive difference (prime) that has not occurred earlier.A094750
Rearrangement of composite numbers so that the successive differences are distinct prime numbers. Priority is given to the least successive difference (prime) that has not occurred earlier.
- Primes arising as the successive difference in A094750.A094751
Primes arising as the successive difference in A094750.
- Largest k such that 2n/k + 1 as well as 2nk+1 are prime, or 0 if no such number exists.A094752
Largest k such that 2n/k + 1 as well as 2nk+1 are prime, or 0 if no such number exists.
- Largest k such that (2n-1)/k + 2 as well as (2n-1)k + 2 are prime, or 0 if no such number exists.A094753
Largest k such that (2n-1)/k + 2 as well as (2n-1)k + 2 are prime, or 0 if no such number exists.
- Middle coefficient of cyclotomic polynomial Phi_n(x).A094754
Middle coefficient of cyclotomic polynomial Phi_n(x).
- Least integer value of (1 + 2^n + 3^n + ... + k^n)/(1 + 2 + 3 + ... + k), k > 1.A094755
Least integer value of (1 + 2^n + 3^n + ... + k^n)/(1 + 2 + 3 + ... + k), k > 1.
- a(n) = least k>1 such that (1+2+3+...+k) divides (1^n + 2^n + 3^n + ... + k^n).A094756
a(n) = least k>1 such that (1+2+3+...+k) divides (1^n + 2^n + 3^n + ... + k^n).
- Least positive k <= n such that n*pi(k) = k*pi(n), where pi(n) is the number of primes <= n (A000720).A094757
Least positive k <= n such that n*pi(k) = k*pi(n), where pi(n) is the number of primes <= n (A000720).
- Least k <= n such that n*tau(k) = k*tau(n), where tau(n) is the number of divisors of n (A000005).A094758
Least k <= n such that n*tau(k) = k*tau(n), where tau(n) is the number of divisors of n (A000005).
- Least k <= n such that n*sigma(k) = k*sigma(n), where sigma(n) is the sum of divisors of n (A000203).A094759
Least k <= n such that n*sigma(k) = k*sigma(n), where sigma(n) is the sum of divisors of n (A000203).
- Duplicate of A083956.A094760
Duplicate of A083956.