Sequences
392,541 sequences
- Initial primes of Cunningham chains of first type with length exactly 2. Primes in A059453 that survive as primes only one "2p-1 iteration", forming chains of exactly 2 terms.A059761
Initial primes of Cunningham chains of first type with length exactly 2. Primes in A059453 that survive as primes only one "2p-1 iteration", forming chains of exactly 2 terms.
- Initial primes of Cunningham chains of first type with length exactly 3. Primes in A059453 that survive as primes just two "2p+1 iterations", forming chains of exactly 3 terms.A059762
Initial primes of Cunningham chains of first type with length exactly 3. Primes in A059453 that survive as primes just two "2p+1 iterations", forming chains of exactly 3 terms.
- Primes starting a Cunningham chain of the first kind of length 4.A059763
Primes starting a Cunningham chain of the first kind of length 4.
- Initial (unsafe) primes of Cunningham chains of first type with length exactly 5. Primes in A059453 that survive as primes just four "2p+1 iterations", forming chains of exactly 5 terms.A059764
Initial (unsafe) primes of Cunningham chains of first type with length exactly 5. Primes in A059453 that survive as primes just four "2p+1 iterations", forming chains of exactly 5 terms.
- Possible sizes of the torsion group of an elliptic curve over the rationals Q. This is a finite sequence.A059765
Possible sizes of the torsion group of an elliptic curve over the rationals Q. This is a finite sequence.
- Initial (unsafe) primes of Cunningham chains of first type with length exactly 6.A059766
Initial (unsafe) primes of Cunningham chains of first type with length exactly 6.
- Initial (unsafe) primes of Cunningham chains of first type with length exactly 7.A059767
Initial (unsafe) primes of Cunningham chains of first type with length exactly 7.
- Numbers k such that 2*3^k + 35 is prime.A059768
Numbers k such that 2*3^k + 35 is prime.
- Frobenius number of the subsemigroup of the natural numbers generated by successive pairs of Fibonacci numbers.A059769
Frobenius number of the subsemigroup of the natural numbers generated by successive pairs of Fibonacci numbers.
- First solution of x^2 = 2 mod p for primes p such that a solution exists.A059770
First solution of x^2 = 2 mod p for primes p such that a solution exists.
- Second solution of x^2 = 2 mod p for primes p such that a solution exists.A059771
Second solution of x^2 = 2 mod p for primes p such that a solution exists.
- Smallest prime p such that n is a solution mod p of x^2 = 2, or 0 if no such prime exists.A059772
Smallest prime p such that n is a solution mod p of x^2 = 2, or 0 if no such prime exists.
- Maximum size of Aut(G) where G is a finite group of order n.A059773
Maximum size of Aut(G) where G is a finite group of order n.
- Consider the line segment in R^n from the origin to the point P=(1,2,3,...,n); let d = squared distance to this line from the closest point of Z^n (excluding the endpoints). Sequence gives d times P.P.A059774
Consider the line segment in R^n from the origin to the point P=(1,2,3,...,n); let d = squared distance to this line from the closest point of Z^n (excluding the endpoints). Sequence gives d times P.P.
- From solution to a counting problem.A059775
From solution to a counting problem.
- Three-quadrant Ferrers graphs that partition n.A059776
Three-quadrant Ferrers graphs that partition n.
- Number of self-conjugate three-quadrant Ferrers graphs that partition n.A059777
Number of self-conjugate three-quadrant Ferrers graphs that partition n.
- Expansion of 1 / product((1+q^(2*n+3))/(1-q^(2*n+2)), n=0..inf).A059778
Expansion of 1 / product((1+q^(2*n+3))/(1-q^(2*n+2)), n=0..inf).
- A Lucas triangle: T(m,n), m >= n >= 0.A059779
A Lucas triangle: T(m,n), m >= n >= 0.
- A generalized Pascal triangle of order 3: T(n,m), n >= 0, 2*n >= m >= 0.A059780
A generalized Pascal triangle of order 3: T(n,m), n >= 0, 2*n >= m >= 0.
- Triangle T(n,k) giving exponent of power of 2 dividing entry (n,k) of trinomial triangle A027907.A059781
Triangle T(n,k) giving exponent of power of 2 dividing entry (n,k) of trinomial triangle A027907.
- Triangle T(n,k) giving exponent of power of 3 dividing entry (n,k) of trinomial triangle A027907.A059782
Triangle T(n,k) giving exponent of power of 3 dividing entry (n,k) of trinomial triangle A027907.
- Number of paths (without loops) in graph of n-dimensional hypercube starting at point (0,0,0,...,0) and ending at (1,1,1,...,1).A059783
Number of paths (without loops) in graph of n-dimensional hypercube starting at point (0,0,0,...,0) and ending at (1,1,1,...,1).
- a(n+1) = nextprime(a(n)^2). Smallest prime following the square of previous prime. Initial value = 2.A059784
a(n+1) = nextprime(a(n)^2). Smallest prime following the square of previous prime. Initial value = 2.
- a(n+1) = prevprime(a(n)^2). Largest prime prior to the square of previous prime. Initial value = 2.A059785
a(n+1) = prevprime(a(n)^2). Largest prime prior to the square of previous prime. Initial value = 2.
- Smallest prime after 2*(n-th prime).A059786
Smallest prime after 2*(n-th prime).
- Distance between 2*(n-th prime) and next prime.A059787
Distance between 2*(n-th prime) and next prime.
- a(n) = largest prime < 2*prime(n).A059788
a(n) = largest prime < 2*prime(n).
- Distance of 2*prime(n) from previous prime.A059789
Distance of 2*prime(n) from previous prime.
- Distance between 2*(n-th prime) and nearest prime.A059790
Distance between 2*(n-th prime) and nearest prime.
- Numbers k such that floor(phi^k) is prime, where phi is the golden ratio.A059791
Numbers k such that floor(phi^k) is prime, where phi is the golden ratio.
- Numbers k such that floor(Pi^k) is prime.A059792
Numbers k such that floor(Pi^k) is prime.
- Stationary value of quotient in the continued fraction expansion of sqrt(prime) when the quotient-cycle-length = 1.A059793
Stationary value of quotient in the continued fraction expansion of sqrt(prime) when the quotient-cycle-length = 1.
- a(n) = n* - 2^(n-1), where n* (A003418) = least common multiple of the numbers [1,...,n].A059794
a(n) = n* - 2^(n-1), where n* (A003418) = least common multiple of the numbers [1,...,n].
- Numbers k such that k^2 starts with the reverse of k.A059795
Numbers k such that k^2 starts with the reverse of k.
- Degrees of irreducible representations of symmetric group S_14.A059796
Degrees of irreducible representations of symmetric group S_14.
- Second in a series of arrays counting standard tableaux by partition type.A059797
Second in a series of arrays counting standard tableaux by partition type.
- Primes p such that |p - q| is a square, where q is the reversal of p.A059798
Primes p such that |p - q| is a square, where q is the reversal of p.
- Primes which when added to their reversals are squares.A059799
Primes which when added to their reversals are squares.
- Smallest prime p such that the quotient-cycle length in continued fraction expansion of sqrt(p) is n: smallest prime p(m) for which A054269(m)=n.A059800
Smallest prime p such that the quotient-cycle length in continued fraction expansion of sqrt(p) is n: smallest prime p(m) for which A054269(m)=n.
- Numbers k such that 4^k - 3^k is prime.A059801
Numbers k such that 4^k - 3^k is prime.
- Numbers k such that 5^k - 4^k is prime.A059802
Numbers k such that 5^k - 4^k is prime.
- Numbers n such that 9^n - 8^n is prime or a strong pseudoprime.A059803
Numbers n such that 9^n - 8^n is prime or a strong pseudoprime.
- Consider the line segment in R^n from the origin to the point v=(2,3,5,7,11,...) with prime coordinates; let d = squared distance to this line from the closest point of Z^n (excluding the endpoints). Sequence gives d times v.v.A059804
Consider the line segment in R^n from the origin to the point v=(2,3,5,7,11,...) with prime coordinates; let d = squared distance to this line from the closest point of Z^n (excluding the endpoints). Sequence gives d times v.v.
- Natural numbers written with digits grouped in pairs and leading zeros omitted.A059805
Natural numbers written with digits grouped in pairs and leading zeros omitted.
- Minimal size of the center of G where G is a finite group of order n.A059806
Minimal size of the center of G where G is a finite group of order n.
- Maximal size of the commutator subgroup of G where G is a finite group of order n.A059807
Maximal size of the commutator subgroup of G where G is a finite group of order n.
- Numbers which contain the same digits in two different bases.A059808
Numbers which contain the same digits in two different bases.
- Numbers that do not contain exactly the same digits in two different smaller bases.A059809
Numbers that do not contain exactly the same digits in two different smaller bases.
- Numbers k such that 5*7^k + 6 is prime.A059810
Numbers k such that 5*7^k + 6 is prime.