Sequences
392,541 sequences
- Continued fraction for sqrt(993).A040961
Continued fraction for sqrt(993).
- Continued fraction for sqrt(994).A040962
Continued fraction for sqrt(994).
- Continued fraction for sqrt(995).A040963
Continued fraction for sqrt(995).
- Continued fraction for sqrt(996).A040964
Continued fraction for sqrt(996).
- Continued fraction for sqrt(997).A040965
Continued fraction for sqrt(997).
- Continued fraction for sqrt(998).A040966
Continued fraction for sqrt(998).
- Continued fraction for sqrt(999).A040967
Continued fraction for sqrt(999).
- Continued fraction for sqrt(1000).A040968
Continued fraction for sqrt(1000).
- Primes p such that x^5 = 12 has no solution mod p.A040969
Primes p such that x^5 = 12 has no solution mod p.
- Primes p such that x^5 = 13 has a solution mod p.A040970
Primes p such that x^5 = 13 has a solution mod p.
- Primes p such that x^5 = 13 has no solution mod p.A040971
Primes p such that x^5 = 13 has no solution mod p.
- Primes p such that x^5 = 14 has a solution mod p.A040972
Primes p such that x^5 = 14 has a solution mod p.
- Primes p such that x^5 = 14 has no solution mod p.A040973
Primes p such that x^5 = 14 has no solution mod p.
- Primes p such that x^5 = 15 has a solution mod p.A040974
Primes p such that x^5 = 15 has a solution mod p.
- Primes p such that x^5 = 15 has no solution mod p.A040975
Primes p such that x^5 = 15 has no solution mod p.
- a(n) = prime(n) - 2.A040976
a(n) = prime(n) - 2.
- a(n) = binomial(n+5,5)*(n+3)/3.A040977
a(n) = binomial(n+5,5)*(n+3)/3.
- Primes p such that x^5 = 17 has a solution mod p.A040978
Primes p such that x^5 = 17 has a solution mod p.
- Primes p such that x^5 = 17 has no solution mod p.A040979
Primes p such that x^5 = 17 has no solution mod p.
- Primes p such that x^5 = 18 has a solution mod p.A040980
Primes p such that x^5 = 18 has a solution mod p.
- Primes p such that x^5 = 18 has no solution mod p.A040981
Primes p such that x^5 = 18 has no solution mod p.
- Primes p such that x^5 = 19 has a solution mod p.A040982
Primes p such that x^5 = 19 has a solution mod p.
- Primes p such that x^5 = 19 has no solution mod p.A040983
Primes p such that x^5 = 19 has no solution mod p.
- Primes p such that x^23 = 2 has no solution mod p.A040984
Primes p such that x^23 = 2 has no solution mod p.
- Primes p such that x^5 = 20 has no solution mod p.A040985
Primes p such that x^5 = 20 has no solution mod p.
- Primes p such that x^5 = 21 has a solution mod p.A040986
Primes p such that x^5 = 21 has a solution mod p.
- Primes p such that x^5 = 21 has no solution mod p.A040987
Primes p such that x^5 = 21 has no solution mod p.
- Primes p such that x^5 = 22 has a solution mod p.A040988
Primes p such that x^5 = 22 has a solution mod p.
- Primes p such that x^5 = 22 has no solution mod p.A040989
Primes p such that x^5 = 22 has no solution mod p.
- Primes p such that x^5 = 23 has a solution mod p.A040990
Primes p such that x^5 = 23 has a solution mod p.
- Primes p such that x^5 = 23 has no solution mod p.A040991
Primes p such that x^5 = 23 has no solution mod p.
- Primes p such that x^6 = 2 has a solution mod p.A040992
Primes p such that x^6 = 2 has a solution mod p.
- Primes p such that x^6 = 2 has no solution mod p.A040993
Primes p such that x^6 = 2 has no solution mod p.
- Primes p such that x^6 = 3 has a solution mod p.A040994
Primes p such that x^6 = 3 has a solution mod p.
- Primes p such that x^6 = 3 has no solution mod p.A040995
Primes p such that x^6 = 3 has no solution mod p.
- Maximum number of distinct functions at the bottom of a Boolean (or Binary) Decision Diagram (or BDD) with negation by pointer complementation.A040996
Maximum number of distinct functions at the bottom of a Boolean (or Binary) Decision Diagram (or BDD) with negation by pointer complementation.
- Absolute value of first digit of n minus sum of other digits of n.A040997
Absolute value of first digit of n minus sum of other digits of n.
- Primes p such that x^6 = 5 has a solution mod p.A040998
Primes p such that x^6 = 5 has a solution mod p.
- Primes p such that x^6 = 5 has no solution mod p.A040999
Primes p such that x^6 = 5 has no solution mod p.
- If decimal expansion of n-th prime is x1 x2 ... xk, sort the xi into nonincreasing order, y1 y2 ... yk; then a(n) = |y1-y2-y3...-yk|.A041000
If decimal expansion of n-th prime is x1 x2 ... xk, sort the xi into nonincreasing order, y1 y2 ... yk; then a(n) = |y1-y2-y3...-yk|.
- Convolution of A000108(n+1), n >= 0, (Catalan numbers) with A038845 (3-fold convolution of powers of 4).A041001
Convolution of A000108(n+1), n >= 0, (Catalan numbers) with A038845 (3-fold convolution of powers of 4).
- The sequence d, given that c is a left shift by one place of b.A041002
The sequence d, given that c is a left shift by one place of b.
- The sequence e, given that c is a left shift by one place of b.A041003
The sequence e, given that c is a left shift by one place of b.
- The sequence b, given that c is a left shift by one place of b.A041004
The sequence b, given that c is a left shift by one place of b.
- Convolution of Catalan numbers A000108(n+1), n >= 0, with A020918.A041005
Convolution of Catalan numbers A000108(n+1), n >= 0, with A020918.
- Numerators of continued fraction convergents to sqrt(6).A041006
Numerators of continued fraction convergents to sqrt(6).
- Denominators of continued fraction convergents to sqrt(6).A041007
Denominators of continued fraction convergents to sqrt(6).
- Numerators of continued fraction convergents to sqrt(7).A041008
Numerators of continued fraction convergents to sqrt(7).
- Denominators of continued fraction convergents to sqrt(7).A041009
Denominators of continued fraction convergents to sqrt(7).
- Numerators of continued fraction convergents to sqrt(8).A041010
Numerators of continued fraction convergents to sqrt(8).