Sequences
392,541 sequences
- Primes p such that x^29 = 2 has a solution mod p.A049561
Primes p such that x^29 = 2 has a solution mod p.
- Primes p such that x^30 = 2 has a solution mod p.A049562
Primes p such that x^30 = 2 has a solution mod p.
- a(n) = ((prime(n)-1)! + 1) mod (prime(n) + 2).A049563
a(n) = ((prime(n)-1)! + 1) mod (prime(n) + 2).
- Primes p such that x^32 = 2 has a solution mod p.A049564
Primes p such that x^32 = 2 has a solution mod p.
- Primes p such that x^33 = 2 has a solution mod p.A049565
Primes p such that x^33 = 2 has a solution mod p.
- Primes p such that x^34 = 2 has a solution mod p.A049566
Primes p such that x^34 = 2 has a solution mod p.
- Primes p such that x^35 = 2 has a solution mod p.A049567
Primes p such that x^35 = 2 has a solution mod p.
- Primes p such that x^36 = 2 has a solution mod p.A049568
Primes p such that x^36 = 2 has a solution mod p.
- Primes p such that x^37 = 2 has a solution mod p.A049569
Primes p such that x^37 = 2 has a solution mod p.
- Primes p such that x^38 = 2 has a solution mod p.A049570
Primes p such that x^38 = 2 has a solution mod p.
- Primes p such that x^39 = 2 has a solution mod p.A049571
Primes p such that x^39 = 2 has a solution mod p.
- Primes p such that x^40 = 2 has a solution mod p.A049572
Primes p such that x^40 = 2 has a solution mod p.
- Primes p such that x^41 = 2 has a solution mod p.A049573
Primes p such that x^41 = 2 has a solution mod p.
- Primes p such that x^42 = 2 has a solution mod p.A049574
Primes p such that x^42 = 2 has a solution mod p.
- Prime partition numbers.A049575
Prime partition numbers.
- Primes p such that x^44 = 2 has a solution mod p.A049576
Primes p such that x^44 = 2 has a solution mod p.
- Primes p such that x^45 = 2 has a solution mod p.A049577
Primes p such that x^45 = 2 has a solution mod p.
- Primes p such that x^46 = 2 has a solution mod p.A049578
Primes p such that x^46 = 2 has a solution mod p.
- Numbers k such that prime(k)+2 divides (prime(k)-1)!.A049579
Numbers k such that prime(k)+2 divides (prime(k)-1)!.
- Primes p such that x^48 = 2 has a solution mod p.A049580
Primes p such that x^48 = 2 has a solution mod p.
- Table T(n,k) = |n-k| read by antidiagonals (n >= 0, k >= 0).A049581
Table T(n,k) = |n-k| read by antidiagonals (n >= 0, k >= 0).
- Primes p such that x^50 = 2 has a solution mod p.A049582
Primes p such that x^50 = 2 has a solution mod p.
- Primes p such that x^51 = 2 has a solution mod p.A049583
Primes p such that x^51 = 2 has a solution mod p.
- Primes p such that x^52 = 2 has a solution mod p.A049584
Primes p such that x^52 = 2 has a solution mod p.
- Primes p such that x^53 = 2 has a solution mod p.A049585
Primes p such that x^53 = 2 has a solution mod p.
- a(n) is the GCD of the cototients (A051953) of n and n+1.A049586
a(n) is the GCD of the cototients (A051953) of n and n+1.
- Primes p such that x^55 = 2 has a solution mod p.A049587
Primes p such that x^55 = 2 has a solution mod p.
- Primes p such that x^56 = 2 has a solution mod p.A049588
Primes p such that x^56 = 2 has a solution mod p.
- Primes p such that x^57 = 2 has a solution mod p.A049589
Primes p such that x^57 = 2 has a solution mod p.
- Primes p such that x^58 = 2 has a solution mod p.A049590
Primes p such that x^58 = 2 has a solution mod p.
- Odd primes p such that p+2 is composite.A049591
Odd primes p such that p+2 is composite.
- Primes p such that x^60 = 2 has a solution mod p.A049592
Primes p such that x^60 = 2 has a solution mod p.
- Primes p for which residue of ((p-1)! + 1) modulo (p + 16) equals 1.A049593
Primes p for which residue of ((p-1)! + 1) modulo (p + 16) equals 1.
- Primes p such that x^62 = 2 has a solution mod p.A049594
Primes p such that x^62 = 2 has a solution mod p.
- Primes p such that x^63 = 2 has a solution mod p.A049595
Primes p such that x^63 = 2 has a solution mod p.
- Primes p such that x^9 = 2 has a solution mod p.A049596
Primes p such that x^9 = 2 has a solution mod p.
- Triangular array T(n,k) in which k-th column gives coefficients of sum of Gaussian polynomials [k,m] for m=0..k.A049597
Triangular array T(n,k) in which k-th column gives coefficients of sum of Gaussian polynomials [k,m] for m=0..k.
- 12 times triangular numbers.A049598
12 times triangular numbers.
- Number of (1+e)-divisors of n: if n = Product p(i)^r(i), d = Product p(i)^s(i) and s(i) = 0 or s(i) divides r(i), then d is a (1+e)-divisor of n.A049599
Number of (1+e)-divisors of n: if n = Product p(i)^r(i), d = Product p(i)^s(i) and s(i) = 0 or s(i) divides r(i), then d is a (1+e)-divisor of n.
- Array T read by diagonals; T(i,j) is the number of paths from (0,0) to (i,j) consisting of nonvertical segments (x(k),y(k))-to-(x(k+1),y(k+1)) such that 0 = x(1) < x(2) < ... < x(n-1) < x(n)=i, 0 = y(1) <= y(2) <= ... <= y(n-1) <= y(n)=j, for i >= 0, j >= 0.A049600
Array T read by diagonals; T(i,j) is the number of paths from (0,0) to (i,j) consisting of nonvertical segments (x(k),y(k))-to-(x(k+1),y(k+1)) such that 0 = x(1) < x(2) < ... < x(n-1) < x(n)=i, 0 = y(1) <= y(2) <= ... <= y(n-1) <= y(n)=j, for i >= 0, j >= 0.
- a(n)=Sum{T(2i,n-2i): i=0,1,...,[ n/2 ]}, array T as in A049600.A049601
a(n)=Sum{T(2i,n-2i): i=0,1,...,[ n/2 ]}, array T as in A049600.
- a(n) = (Fibonacci(2*n)-(-1)^n*Fibonacci(n))/2.A049602
a(n) = (Fibonacci(2*n)-(-1)^n*Fibonacci(n))/2.
- (1+e)-sigma perfect numbers: (1+e) - sigma(x) = 2*x.A049603
(1+e)-sigma perfect numbers: (1+e) - sigma(x) = 2*x.
- Array T read by diagonals: T(i,j)=least number of knight's moves on unbounded chessboard from corner (0,0) to square (i,j).A049604
Array T read by diagonals: T(i,j)=least number of knight's moves on unbounded chessboard from corner (0,0) to square (i,j).
- Smallest k>1 such that k divides sigma(k*n).A049605
Smallest k>1 such that k divides sigma(k*n).
- Largest odd divisor of n!.A049606
Largest odd divisor of n!.
- Duplicate of A035029.A049607
Duplicate of A035029.
- a(n)=T(n,n+2), array T as in A049600.A049608
a(n)=T(n,n+2), array T as in A049600.
- a(n)=T(n,n+3), array T as in A049600.A049609
a(n)=T(n,n+3), array T as in A049600.
- a(n) = Sum_{k=0..floor(n/2)} k*binomial(n,2*k) = floor(n*2^(n-3)).A049610
a(n) = Sum_{k=0..floor(n/2)} k*binomial(n,2*k) = floor(n*2^(n-3)).