Sequences
392,541 sequences
- Like A059459, but each term must be greater than the previous ones.A059661
Like A059459, but each term must be greater than the previous ones.
- Positions of the flipped bits (here they are always set from 0 to 1) in the sequence A059661.A059662
Positions of the flipped bits (here they are always set from 0 to 1) in the sequence A059661.
- Positions of the flipped bits in the sequence A059459.A059663
Positions of the flipped bits in the sequence A059459.
- Primes p such that x^18 = 2 has no solution mod p, but x^6 = 2 has a solution mod p.A059664
Primes p such that x^18 = 2 has no solution mod p, but x^6 = 2 has a solution mod p.
- Primes p such that x^54 = 2 has no solution mod p, but x^6 = 2 has a solution mod p.A059665
Primes p such that x^54 = 2 has no solution mod p, but x^6 = 2 has a solution mod p.
- Primes p such that x^54 = 2 has no solution mod p, but x^18 = 2 has a solution mod p.A059666
Primes p such that x^54 = 2 has no solution mod p, but x^18 = 2 has a solution mod p.
- Primes p such that x^49 = 2 has no solution mod p, but x^7 = 2 has a solution mod p.A059667
Primes p such that x^49 = 2 has no solution mod p, but x^7 = 2 has a solution mod p.
- Primes p such that x^36 = 2 has no solution mod p, but x^12 = 2 has a solution mod p.A059668
Primes p such that x^36 = 2 has no solution mod p, but x^12 = 2 has a solution mod p.
- Primes p such that x^48 = 2 has no solution mod p, but x^24 = 2 has a solution mod p.A059669
Primes p such that x^48 = 2 has no solution mod p, but x^24 = 2 has a solution mod p.
- Numbers k such that F(k)*2^k + 1 (A006483) is prime, where F(k) is the k-th Fibonacci number.A059670
Numbers k such that F(k)*2^k + 1 (A006483) is prime, where F(k) is the k-th Fibonacci number.
- Numbers n such that n*10^n - 1 is prime.A059671
Numbers n such that n*10^n - 1 is prime.
- Sum of binary numbers with n 1's and one (possibly leading) 0.A059672
Sum of binary numbers with n 1's and one (possibly leading) 0.
- Sum of binary numbers with n 1's and one (non-leading) 0.A059673
Sum of binary numbers with n 1's and one (non-leading) 0.
- Square array a(m,n) = binomial(max(m,n), min(m,n)) (m>=0, n>=0) read by antidiagonals.A059674
Square array a(m,n) = binomial(max(m,n), min(m,n)) (m>=0, n>=0) read by antidiagonals.
- Numbers n such that n*6^n - 1 is prime.A059675
Numbers n such that n*6^n - 1 is prime.
- Numbers n such that n*5^n - 1 is prime.A059676
Numbers n such that n*5^n - 1 is prime.
- Numbers n such that 1n1, 3n3, 7n7 and 9n9 are all primes.A059677
Numbers n such that 1n1, 3n3, 7n7 and 9n9 are all primes.
- Triangle T(n,k) giving number of fixed 2 X k polyominoes with n cells (n >= 2, 1<=k<=n-1).A059678
Triangle T(n,k) giving number of fixed 2 X k polyominoes with n cells (n >= 2, 1<=k<=n-1).
- Triangle T(n,k) giving number of fixed 3 X k polyominoes with n cells (n >= 3, 1<=k<=n-2).A059679
Triangle T(n,k) giving number of fixed 3 X k polyominoes with n cells (n >= 3, 1<=k<=n-2).
- Triangle T(n,k) read by rows giving number of fixed 4 X k polyominoes with n cells (n >= 4, 1<=k<=n-3).A059680
Triangle T(n,k) read by rows giving number of fixed 4 X k polyominoes with n cells (n >= 4, 1<=k<=n-3).
- Triangle T(n,k) giving number of fixed 5 X k polyominoes with n cells (n >= 5, 1<=k<=n-4).A059681
Triangle T(n,k) giving number of fixed 5 X k polyominoes with n cells (n >= 5, 1<=k<=n-4).
- Triangle T(n,k) giving number of 2 X k polyominoes with n cells (n >= 2, 1<=k<=n-1).A059682
Triangle T(n,k) giving number of 2 X k polyominoes with n cells (n >= 2, 1<=k<=n-1).
- Triangle T(n,k) giving number of 3 X k polyominoes with n cells (n >= 3, 1<=k<=n-2).A059683
Triangle T(n,k) giving number of 3 X k polyominoes with n cells (n >= 3, 1<=k<=n-2).
- Triangle T(n,k) giving number of 4 X k polyominoes with n cells (n >= 4, 1<=k<=n-3).A059684
Triangle T(n,k) giving number of 4 X k polyominoes with n cells (n >= 4, 1<=k<=n-3).
- Number of split interval orders on n points.A059685
Number of split interval orders on n points.
- Grimm numbers (1): a(n) = largest k so that for each m in {n+1, n+2, ..., n+k} there corresponds a different prime factor p_m.A059686
Grimm numbers (1): a(n) = largest k so that for each m in {n+1, n+2, ..., n+k} there corresponds a different prime factor p_m.
- Number of basic circuits of nullity n.A059687
Number of basic circuits of nullity n.
- Length of Cunningham chain containing prime(n) either as initial, internal or final term.A059688
Length of Cunningham chain containing prime(n) either as initial, internal or final term.
- List consisting of all functions from [1,2,3,...,n] into [1,2,3,...,n] for n=1,2,3,... (written out in full) in lexicographic order.A059689
List consisting of all functions from [1,2,3,...,n] into [1,2,3,...,n] for n=1,2,3,... (written out in full) in lexicographic order.
- Number of distinct Cunningham chains of first kind whose initial prime (cf. A059453) <= 2^n.A059690
Number of distinct Cunningham chains of first kind whose initial prime (cf. A059453) <= 2^n.
- Carryless product 12 X n base 10.A059691
Carryless product 12 X n base 10.
- Table of carryless products i * j, i>=0, j>=0, read by antidiagonals.A059692
Table of carryless products i * j, i>=0, j>=0, read by antidiagonals.
- Palindromes n such that 1n1, 3n3, 7n7 and 9n9 are all primes.A059693
Palindromes n such that 1n1, 3n3, 7n7 and 9n9 are all primes.
- Primes p such that 1p1, 3p3, 7p7 and 9p9 are all primes.A059694
Primes p such that 1p1, 3p3, 7p7 and 9p9 are all primes.
- Primes p such that p^2 reversed is also prime.A059695
Primes p such that p^2 reversed is also prime.
- Primes p such that p^3 reversed is also prime.A059696
Primes p such that p^3 reversed is also prime.
- Primes p such that p^4 reversed is also prime.A059697
Primes p such that p^4 reversed is also prime.
- Primes p such that p^5 reversed is also prime.A059698
Primes p such that p^5 reversed is also prime.
- Primes p such that p^6 reversed is also prime.A059699
Primes p such that p^6 reversed is also prime.
- Primes p such that p^7 reversed is also prime.A059700
Primes p such that p^7 reversed is also prime.
- Primes p such that p^8 reversed is also prime.A059701
Primes p such that p^8 reversed is also prime.
- Primes p such that p^9 reversed is also prime.A059702
Primes p such that p^9 reversed is also prime.
- Primes p such that p^10 reversed is also prime.A059703
Primes p such that p^10 reversed is also prime.
- Primes p such that p^11 reversed is also prime.A059704
Primes p such that p^11 reversed is also prime.
- Primes p such that p^12 reversed is also prime.A059705
Primes p such that p^12 reversed is also prime.
- Smallest prime p such that p^n reversed is a prime.A059706
Smallest prime p such that p^n reversed is a prime.
- If all digits have the same parity, stop; otherwise write down the number formed by the even digits and the number formed by the odd digits and multiply them; repeat.A059707
If all digits have the same parity, stop; otherwise write down the number formed by the even digits and the number formed by the odd digits and multiply them; repeat.
- Numbers k such that all digits have same parity.A059708
Numbers k such that all digits have same parity.
- Numbers k such that A003266(k) - 1 is prime.A059709
Numbers k such that A003266(k) - 1 is prime.
- Dimension of space of invariants of n-th tensor power of 7-dimensional irreducible representation of G_2. Also the number of n-leaf, otherwise trivalent graphs in a disk such that all faces have at least 6 sides.A059710
Dimension of space of invariants of n-th tensor power of 7-dimensional irreducible representation of G_2. Also the number of n-leaf, otherwise trivalent graphs in a disk such that all faces have at least 6 sides.