Sequences
392,541 sequences
- The sequence e when b is obtained by reversing the parity of Euler's partition function A000041.A042961
The sequence e when b is obtained by reversing the parity of Euler's partition function A000041.
- The sequence e when b=[ 1,0,1,0,1,0,1,0,... ].A042962
The sequence e when b=[ 1,0,1,0,1,0,1,0,... ].
- Numbers congruent to 1 or 2 mod 4.A042963
Numbers congruent to 1 or 2 mod 4.
- Numbers that are congruent to 2 or 3 mod 4.A042964
Numbers that are congruent to 2 or 3 mod 4.
- Nonnegative integers not congruent to 2 mod 4.A042965
Nonnegative integers not congruent to 2 mod 4.
- Primes p such that x^7 = 2 has a solution mod p.A042966
Primes p such that x^7 = 2 has a solution mod p.
- Primes p such that x^7 = 2 has no solution mod p.A042967
Primes p such that x^7 = 2 has no solution mod p.
- Numbers not divisible by 4.A042968
Numbers not divisible by 4.
- Primes p such that x^7 = 3 has no solution mod p.A042969
Primes p such that x^7 = 3 has no solution mod p.
- a(n) = binomial(n, floor(n/2)) mod n.A042970
a(n) = binomial(n, floor(n/2)) mod n.
- a(n) = (C(2n, n)/2 - (2^(n-1) + ((n+1) mod 2)*C(n-1, n/2-1)))/2.A042971
a(n) = (C(2n, n)/2 - (2^(n-1) + ((n+1) mod 2)*C(n-1, n/2-1)))/2.
- Decimal expansion of i^(-i), where i = sqrt(-1).A042972
Decimal expansion of i^(-i), where i = sqrt(-1).
- Primes p such that x^7 = 5 has no solution mod p.A042973
Primes p such that x^7 = 5 has no solution mod p.
- n 1's followed by a 2.A042974
n 1's followed by a 2.
- Decimal expansion of sqrt(0.121121112...).A042975
Decimal expansion of sqrt(0.121121112...).
- Decimal expansion of 0.121121112...^2.A042976
Decimal expansion of 0.121121112...^2.
- Triangle T(n,k) read by rows: coefficients of a polynomial sequence occurring when calculating the n-th derivative of Lambert function W.A042977
Triangle T(n,k) read by rows: coefficients of a polynomial sequence occurring when calculating the n-th derivative of Lambert function W.
- Stern primes: primes not of the form p + 2b^2 for p prime and b > 0.A042978
Stern primes: primes not of the form p + 2b^2 for p prime and b > 0.
- Number of degree-n irreducible polynomials over GF(2) with trace = 0 and subtrace = 1.A042979
Number of degree-n irreducible polynomials over GF(2) with trace = 0 and subtrace = 1.
- Number of degree-n irreducible polynomials over GF(2) with trace = 0 and subtrace = 0.A042980
Number of degree-n irreducible polynomials over GF(2) with trace = 0 and subtrace = 0.
- Number of degree-n irreducible polynomials over GF(2) with trace = 1 and subtrace = 0.A042981
Number of degree-n irreducible polynomials over GF(2) with trace = 1 and subtrace = 0.
- Number of degree-n irreducible polynomials over GF(2) with trace = 1 and subtrace = 1.A042982
Number of degree-n irreducible polynomials over GF(2) with trace = 1 and subtrace = 1.
- Numbers n > 99 with following property: form a sequence whose initial terms are the t digits of n, later terms given by rule b(i+1) = b(i) + product of t-1 previous terms; then n itself appears in the sequence.A042983
Numbers n > 99 with following property: form a sequence whose initial terms are the t digits of n, later terms given by rule b(i+1) = b(i) + product of t-1 previous terms; then n itself appears in the sequence.
- Number of n-dimensional partitions of 6.A042984
Number of n-dimensional partitions of 6.
- Convolution of A000108 (Catalan numbers) with A038846.A042985
Convolution of A000108 (Catalan numbers) with A038846.
- Primes congruent to {0, 1, 2, 3} mod 5.A042986
Primes congruent to {0, 1, 2, 3} mod 5.
- Primes congruent to {2, 3, 5, 7} mod 8.A042987
Primes congruent to {2, 3, 5, 7} mod 8.
- Primes not congruent to -1 (mod 7).A042988
Primes not congruent to -1 (mod 7).
- Primes congruent to {0, 2, 3, 4, 5} mod 7.A042989
Primes congruent to {0, 2, 3, 4, 5} mod 7.
- Primes not congruent to 4 (mod 7).A042990
Primes not congruent to 4 (mod 7).
- Primes congruent to {0, 2, 3, 4} (mod 5).A042991
Primes congruent to {0, 2, 3, 4} (mod 5).
- Primes congruent to {0, 2, 3, 5, 6} (mod 7).A042992
Primes congruent to {0, 2, 3, 5, 6} (mod 7).
- Primes congruent to {0, 2, 3} mod 5.A042993
Primes congruent to {0, 2, 3} mod 5.
- Primes congruent to {0, 1, 2, 3, 5} (mod 7).A042994
Primes congruent to {0, 1, 2, 3, 5} (mod 7).
- Primes congruent to {0, 2, 3, 5} (mod 7).A042995
Primes congruent to {0, 2, 3, 5} (mod 7).
- Numbers k such that binomial(k, floor(k/2)) is divisible by k.A042996
Numbers k such that binomial(k, floor(k/2)) is divisible by k.
- Primes congruent to {2, 3, 4, 5, 6} (mod 7).A042997
Primes congruent to {2, 3, 4, 5, 6} (mod 7).
- Primes congruent to {1, 2, 3, 5} (mod 8).A042998
Primes congruent to {1, 2, 3, 5} (mod 8).
- Primes congruent to {2, 3, 5} (mod 8).A042999
Primes congruent to {2, 3, 5} (mod 8).
- Number of digits in all base-b representations of n, for 2 <= b <= n.A043000
Number of digits in all base-b representations of n, for 2 <= b <= n.
- Base-3 palindromes that start with 1.A043001
Base-3 palindromes that start with 1.
- Base-3 palindromes that start with 2.A043002
Base-3 palindromes that start with 2.
- Base-4 palindromes that start with 1.A043003
Base-4 palindromes that start with 1.
- Base-4 palindromes that start with 2.A043004
Base-4 palindromes that start with 2.
- Base-4 palindromes that start with 3.A043005
Base-4 palindromes that start with 3.
- Base-5 palindromes that start with 1.A043006
Base-5 palindromes that start with 1.
- Base-5 palindromes that start with 2.A043007
Base-5 palindromes that start with 2.
- Base-5 palindromes that start with 3.A043008
Base-5 palindromes that start with 3.
- Base-5 palindromes that start with 4.A043009
Base-5 palindromes that start with 4.
- Base-6 palindromes that start with 1.A043010
Base-6 palindromes that start with 1.