Sequences
392,541 sequences
- Twice the positions in A051686 at which new primes appear in that sequence.A051861
Twice the positions in A051686 at which new primes appear in that sequence.
- Perturbation expansion in quantum field theory: scalar case in 6 spacetime dimensions.A051862
Perturbation expansion in quantum field theory: scalar case in 6 spacetime dimensions.
- Duplicate of A000699.A051863
Duplicate of A000699.
- Sum of transposition distances (divided by 2) present in the permutation produced by inverses of 1..(p-1) computed in Zp, where p is n-th prime.A051864
Sum of transposition distances (divided by 2) present in the permutation produced by inverses of 1..(p-1) computed in Zp, where p is n-th prime.
- 13-gonal (or tridecagonal) numbers: a(n) = n*(11*n - 9)/2.A051865
13-gonal (or tridecagonal) numbers: a(n) = n*(11*n - 9)/2.
- 14-gonal (or tetradecagonal) numbers: a(n) = n*(6*n-5).A051866
14-gonal (or tetradecagonal) numbers: a(n) = n*(6*n-5).
- 15-gonal (or pentadecagonal) numbers: n*(13n-11)/2.A051867
15-gonal (or pentadecagonal) numbers: n*(13n-11)/2.
- 16-gonal (or hexadecagonal) numbers: a(n) = n*(7*n-6).A051868
16-gonal (or hexadecagonal) numbers: a(n) = n*(7*n-6).
- 17-gonal (or heptadecagonal) numbers: a(n) = n*(15*n-13)/2.A051869
17-gonal (or heptadecagonal) numbers: a(n) = n*(15*n-13)/2.
- 18-gonal (or octadecagonal) numbers: a(n) = n*(8*n-7).A051870
18-gonal (or octadecagonal) numbers: a(n) = n*(8*n-7).
- 19-gonal (or enneadecagonal) numbers: n(17n-15)/2.A051871
19-gonal (or enneadecagonal) numbers: n(17n-15)/2.
- 20-gonal (or icosagonal) numbers: a(n) = n*(9*n-8).A051872
20-gonal (or icosagonal) numbers: a(n) = n*(9*n-8).
- 21-gonal numbers: a(n) = n*(19n - 17)/2.A051873
21-gonal numbers: a(n) = n*(19n - 17)/2.
- 22-gonal numbers: a(n) = n*(10*n-9).A051874
22-gonal numbers: a(n) = n*(10*n-9).
- 23-gonal numbers: a(n) = n(21n-19)/2.A051875
23-gonal numbers: a(n) = n(21n-19)/2.
- 24-gonal numbers: a(n) = n*(11*n-10).A051876
24-gonal numbers: a(n) = n*(11*n-10).
- Partial sums of A051740.A051877
Partial sums of A051740.
- Partial sums of A051797.A051878
Partial sums of A051797.
- Partial sums of A051798.A051879
Partial sums of A051798.
- a(n) = binomial(n+4,4)*(2*n+1).A051880
a(n) = binomial(n+4,4)*(2*n+1).
- Number of subgroups of order n in special orthogonal group SO(3).A051881
Number of subgroups of order n in special orthogonal group SO(3).
- Call m strict-sense Egyptian if we can partition m = x_1+x_2+...+x_k into distinct positive integers x_i such that Sum_{i=1..k} 1/x_i = 1; sequence gives all numbers that are not strict-sense Egyptian.A051882
Call m strict-sense Egyptian if we can partition m = x_1+x_2+...+x_k into distinct positive integers x_i such that Sum_{i=1..k} 1/x_i = 1; sequence gives all numbers that are not strict-sense Egyptian.
- a(n) is the smallest number such that the concatenation of a(1)a(2)a(3)...a(n) is divisible by n.A051883
a(n) is the smallest number such that the concatenation of a(1)a(2)a(3)...a(n) is divisible by n.
- Smallest number larger than the previous term which is not a prime but is relatively prime to the previous term.A051884
Smallest number larger than the previous term which is not a prime but is relatively prime to the previous term.
- Smallest number whose sum of digits is n.A051885
Smallest number whose sum of digits is n.
- a(n) is the minimal prime p such that 2^n * p + 1 is prime.A051886
a(n) is the minimal prime p such that 2^n * p + 1 is prime.
- Minimal and special 2k-Germain primes, where 2k is in A002110 (primorial numbers).A051887
Minimal and special 2k-Germain primes, where 2k is in A002110 (primorial numbers).
- a(n) is the smallest prime p such that p*n! + 1 is prime.A051888
a(n) is the smallest prime p such that p*n! + 1 is prime.
- a(n) = min{m: Sum_{j=0..m} binomial(n,j)*(1/6)^j*(1-1/6)^(n-i) >= 0.95}.A051889
a(n) = min{m: Sum_{j=0..m} binomial(n,j)*(1/6)^j*(1-1/6)^(n-i) >= 0.95}.
- a(n) = 2*(n^2 - n + 1).A051890
a(n) = 2*(n^2 - n + 1).
- Values of m, the main key or generating number for Pythagorean triangles in which S (the odd short leg) and U (the hypotenuse) are twin primes.A051891
Values of m, the main key or generating number for Pythagorean triangles in which S (the odd short leg) and U (the hypotenuse) are twin primes.
- Values of e, the lesser key or generating number for Pythagorean triangles in which S (the odd short leg) and U (the hypotenuse) are twin primes.A051892
Values of e, the lesser key or generating number for Pythagorean triangles in which S (the odd short leg) and U (the hypotenuse) are twin primes.
- a(n) = Sum_{i=1..n-1} i^2*a(i), a(1) = 1.A051893
a(n) = Sum_{i=1..n-1} i^2*a(i), a(1) = 1.
- Number of monic polynomials with integer coefficients of degree n with all roots in unit disc.A051894
Number of monic polynomials with integer coefficients of degree n with all roots in unit disc.
- Partial sums of second pentagonal numbers with even index (A049453).A051895
Partial sums of second pentagonal numbers with even index (A049453).
- a(n) = smallest palindrome > a(n-1) such that a(1)*a(2)*...*a(n) + 1 is prime with a(1) = 2.A051896
a(n) = smallest palindrome > a(n-1) such that a(1)*a(2)*...*a(n) + 1 is prime with a(1) = 2.
- Values of n such that 90n+11, 90n+13, 90n+17, 90n+19 are all primes.A051897
Values of n such that 90n+11, 90n+13, 90n+17, 90n+19 are all primes.
- Erroneous version of A002095.A051898
Erroneous version of A002095.
- Smallest prime p such that (p-1)/(2*n) is also a prime.A051899
Smallest prime p such that (p-1)/(2*n) is also a prime.
- Minimal 2^n safe-primes: a(n) = 2^n*A051886(n) + 1 (a prime number).A051900
Minimal 2^n safe-primes: a(n) = 2^n*A051886(n) + 1 (a prime number).
- Minimal factorial safe-primes: a prime p = a(n) here if (p-1)/n! = A051888(n).A051901
Minimal factorial safe-primes: a prime p = a(n) here if (p-1)/n! = A051888(n).
- Minimal primorial safe primes: p and primorial*p + 1 are both primes.A051902
Minimal primorial safe primes: p and primorial*p + 1 are both primes.
- Maximum exponent in the prime factorization of n.A051903
Maximum exponent in the prime factorization of n.
- Minimal exponent in prime factorization of n.A051904
Minimal exponent in prime factorization of n.
- Duplicate of A051426.A051905
Duplicate of A051426.
- Number of ways of placing n nonattacking queens on an n X n toroidal chessboard.A051906
Number of ways of placing n nonattacking queens on an n X n toroidal chessboard.
- Number of ways to express 1 as the sum of distinct unit fractions such that the sum of the denominators is n.A051907
Number of ways to express 1 as the sum of distinct unit fractions such that the sum of the denominators is n.
- Number of ways to express 1 as the sum of unit fractions such that the sum of the denominators is n.A051908
Number of ways to express 1 as the sum of unit fractions such that the sum of the denominators is n.
- Subset of strict Egyptian numbers - there is a unique representation of 1 as the sum of distinct unit fractions with the sum of denominators being these numbers.A051909
Subset of strict Egyptian numbers - there is a unique representation of 1 as the sum of distinct unit fractions with the sum of denominators being these numbers.
- Triangle T(n,m) = Nim-product of n and m, read by rows, 0<=m<=n.A051910
Triangle T(n,m) = Nim-product of n and m, read by rows, 0<=m<=n.