Sequences
392,541 sequences
- a(n) = Product_{i=2..n} (prime(i) - 2).A059861
a(n) = Product_{i=2..n} (prime(i) - 2).
- a(n) = Product_{i=3..n} (prime(i) - 3).A059862
a(n) = Product_{i=3..n} (prime(i) - 3).
- a(n) = Product_{i=3..n} (prime(i) - 4).A059863
a(n) = Product_{i=3..n} (prime(i) - 4).
- a(n) = Product_{i=4..n} (prime(i) - 5).A059864
a(n) = Product_{i=4..n} (prime(i) - 5).
- a(n) = Product_{i=4..n} (prime(i) - 6).A059865
a(n) = Product_{i=4..n} (prime(i) - 6).
- Period of the continued fraction for sqrt(2^n-1).A059866
Period of the continued fraction for sqrt(2^n-1).
- Number of irreducible representations of the symmetric group S_n that have odd degree.A059867
Number of irreducible representations of the symmetric group S_n that have odd degree.
- There exist no palindromic pentagonal numbers of length a(n).A059868
There exist no palindromic pentagonal numbers of length a(n).
- Numbers k such that there exist no palindromic heptagonals of length k.A059869
Numbers k such that there exist no palindromic heptagonals of length k.
- Numbers n such that there exist no palindromic octagonal numbers of length n.A059870
Numbers n such that there exist no palindromic octagonal numbers of length n.
- Number of solutions to the equation p_i = (1+mod(i,2))*p_{i-1} +- p_{i-2} +- p_{i-3} +- ... +- 2 +- 1, where p_i is the i-th prime number (where p_1 = 2 and the "zeroth prime" p_0 is defined to be 1).A059871
Number of solutions to the equation p_i = (1+mod(i,2))*p_{i-1} +- p_{i-2} +- p_{i-3} +- ... +- 2 +- 1, where p_i is the i-th prime number (where p_1 = 2 and the "zeroth prime" p_0 is defined to be 1).
- Solutions to the equation given in A059871, encoded as binary vectors and converted to decimal.A059872
Solutions to the equation given in A059871, encoded as binary vectors and converted to decimal.
- The lexicographically earliest sequence of binary encodings of solutions satisfying the equation given in A059871.A059873
The lexicographically earliest sequence of binary encodings of solutions satisfying the equation given in A059871.
- The lexicographically earliest sequence of binary encodings of solutions satisfying the equation p_i = (1+mod(i,2))*p_{i-1} +- p_{i-2} +- p_{i-3} +- ... +- 2 + 1, where p_i is the i-th prime number.A059874
The lexicographically earliest sequence of binary encodings of solutions satisfying the equation p_i = (1+mod(i,2))*p_{i-1} +- p_{i-2} +- p_{i-3} +- ... +- 2 + 1, where p_i is the i-th prime number.
- The lexicographically last sequence of binary encodings of solutions satisfying the equation given in A059871.A059875
The lexicographically last sequence of binary encodings of solutions satisfying the equation given in A059871.
- a(n) = bin_prime_sum(n).A059876
a(n) = bin_prime_sum(n).
- Those n for which the absolute value of A059876[n] is prime.A059877
Those n for which the absolute value of A059876[n] is prime.
- a(n) = bin_prime_sum(fibonacci(A001651[n])), where fibonacci(A001651[n]) is A014437[n].A059878
a(n) = bin_prime_sum(fibonacci(A001651[n])), where fibonacci(A001651[n]) is A014437[n].
- Those n for which the absolute value of A059878[n] is prime.A059879
Those n for which the absolute value of A059878[n] is prime.
- Positions of negative terms in A059876.A059880
Positions of negative terms in A059876.
- As upper right triangle: wiggly sums to n where first term is k (sums in which terms alternately increase and decrease or vice versa; zigzag and zagzig partitions).A059881
As upper right triangle: wiggly sums to n where first term is k (sums in which terms alternately increase and decrease or vice versa; zigzag and zagzig partitions).
- As upper right triangle: ascending wiggly sums to n where first term is k (sums in which terms alternately increase and decrease; zigzag partitions).A059882
As upper right triangle: ascending wiggly sums to n where first term is k (sums in which terms alternately increase and decrease; zigzag partitions).
- As upper right triangle: descending wiggly sums to n where first term is k (sums in which terms alternately decrease and increase; zagzig partitions).A059883
As upper right triangle: descending wiggly sums to n where first term is k (sums in which terms alternately decrease and increase; zagzig partitions).
- Prime factorization of n encoded by recursively interleaving bits of successive prime exponents.A059884
Prime factorization of n encoded by recursively interleaving bits of successive prime exponents.
- a(n) = |{m : multiplicative order of 3 mod m = n}|.A059885
a(n) = |{m : multiplicative order of 3 mod m = n}|.
- a(n) = |{m : multiplicative order of 4 mod m=n}|.A059886
a(n) = |{m : multiplicative order of 4 mod m=n}|.
- a(n) = |{m : multiplicative order of 5 mod m=n}|.A059887
a(n) = |{m : multiplicative order of 5 mod m=n}|.
- a(n) = |{m : multiplicative order of 6 mod m=n}|.A059888
a(n) = |{m : multiplicative order of 6 mod m=n}|.
- a(n) = |{m : multiplicative order of 7 mod m=n}|.A059889
a(n) = |{m : multiplicative order of 7 mod m=n}|.
- a(n) = |{m : multiplicative order of 8 mod m = n}|.A059890
a(n) = |{m : multiplicative order of 8 mod m = n}|.
- a(n) = |{m : multiplicative order of 9 mod m = n}|.A059891
a(n) = |{m : multiplicative order of 9 mod m = n}|.
- a(n) = |{m : multiplicative order of 10 mod m is equal to n}|.A059892
a(n) = |{m : multiplicative order of 10 mod m is equal to n}|.
- Reverse the order of all but the most significant bit in binary expansion of n: if n = 1ab..yz then a(n) = 1zy..ba.A059893
Reverse the order of all but the most significant bit in binary expansion of n: if n = 1ab..yz then a(n) = 1zy..ba.
- Complement and reverse the order of all but the most significant bit in binary expansion of n. n = 1ab..yz -> 1ZY..BA = a(n), where A = 1-a, B = 1-b, ... .A059894
Complement and reverse the order of all but the most significant bit in binary expansion of n. n = 1ab..yz -> 1ZY..BA = a(n), where A = 1-a, B = 1-b, ... .
- Table a(i,j) = product prime[k]^(Ei[k] AND Ej[k]) where Ei and Ej are the vectors of exponents in the prime factorizations of i and j; AND is the bitwise operation on binary representation of the exponents.A059895
Table a(i,j) = product prime[k]^(Ei[k] AND Ej[k]) where Ei and Ej are the vectors of exponents in the prime factorizations of i and j; AND is the bitwise operation on binary representation of the exponents.
- The set of Fermi-Dirac factors of A(n,k) is the union of the Fermi-Dirac factors of n and k. Symmetric square array read by antidiagonals.A059896
The set of Fermi-Dirac factors of A(n,k) is the union of the Fermi-Dirac factors of n and k. Symmetric square array read by antidiagonals.
- Symmetric square array read by antidiagonals: A(n,k) is the product of all factors that occur in one, but not both, of the Fermi-Dirac factorizations of n and k.A059897
Symmetric square array read by antidiagonals: A(n,k) is the product of all factors that occur in one, but not both, of the Fermi-Dirac factorizations of n and k.
- Duplicate of A014752.A059898
Duplicate of A014752.
- Primes p such that x^3 = 2 has more than one solution mod p and the sum of the (three) solutions is p.A059899
Primes p such that x^3 = 2 has more than one solution mod p and the sum of the (three) solutions is p.
- Successively interleaved alternate bits in binary expansion of n gives vector of exponents in prime factorization of a(n).A059900
Successively interleaved alternate bits in binary expansion of n gives vector of exponents in prime factorization of a(n).
- Partitions encoded by prime factorization. The partition [P1+P2+P3+...] with P1>=P2>=P3>=... is encoded as 2^P1 * 3^P2 * 5^P3 *...A059901
Partitions encoded by prime factorization. The partition [P1+P2+P3+...] with P1>=P2>=P3>=... is encoded as 2^P1 * 3^P2 * 5^P3 *...
- Partitions encoded by interleaving bits in parts. The partition [P1+P2+P3+...] with P1>=P2>=P3>=... is encoded in binary by recursively interleaving the bits of P1 with the (recursively interleaved bits of P2 with the (recursively...)).A059902
Partitions encoded by interleaving bits in parts. The partition [P1+P2+P3+...] with P1>=P2>=P3>=... is encoded in binary by recursively interleaving the bits of P1 with the (recursively interleaved bits of P2 with the (recursively...)).
- Periodic part of continued fraction for sqrt(n), encoded by raising successive primes to the terms. If sqrt(n)=c0+[c1,c2,c3...] then a(n)=2^c1*3^c2*5^c3*...A059903
Periodic part of continued fraction for sqrt(n), encoded by raising successive primes to the terms. If sqrt(n)=c0+[c1,c2,c3...] then a(n)=2^c1*3^c2*5^c3*...
- Periodic part of continued fraction for sqrt(n), encoded by recursively interleaving the bits in the binary expansions of the repeating terms.A059904
Periodic part of continued fraction for sqrt(n), encoded by recursively interleaving the bits in the binary expansions of the repeating terms.
- Index of first half of decomposition of integers into pairs based on A000695.A059905
Index of first half of decomposition of integers into pairs based on A000695.
- Index of second half of decomposition of integers into pairs based on A000695.A059906
Index of second half of decomposition of integers into pairs based on A000695.
- a(n) = |{m : multiplicative order of n mod m = 2}|.A059907
a(n) = |{m : multiplicative order of n mod m = 2}|.
- a(n) = |{m : multiplicative order of n mod m = 3}|.A059908
a(n) = |{m : multiplicative order of n mod m = 3}|.
- a(n) = |{m : multiplicative order of n mod m = 4}|.A059909
a(n) = |{m : multiplicative order of n mod m = 4}|.
- a(n) = |{m : multiplicative order of n mod m = 5}|.A059910
a(n) = |{m : multiplicative order of n mod m = 5}|.