Sequences
392,541 sequences
- a(n) = n^6 mod 38.A070661
a(n) = n^6 mod 38.
- a(n) = n^6 mod 39.A070662
a(n) = n^6 mod 39.
- a(n) = n^6 mod 40.A070663
a(n) = n^6 mod 40.
- a(n) = n^6 mod 41.A070664
a(n) = n^6 mod 41.
- a(n) = n^6 mod 42.A070665
a(n) = n^6 mod 42.
- n^6 mod 43.A070666
n^6 mod 43.
- Smallest m in range 2..n-1 such that m^2 == 1 mod n, or 1 if no such number exists.A070667
Smallest m in range 2..n-1 such that m^2 == 1 mod n, or 1 if no such number exists.
- Smallest m in range 2..n-1 such that m^3 == 1 mod n, or 1 if no such number exists.A070668
Smallest m in range 2..n-1 such that m^3 == 1 mod n, or 1 if no such number exists.
- Smallest m in range 2..n-1 such that m^4 == 1 mod n, or 1 if no such number exists.A070669
Smallest m in range 2..n-1 such that m^4 == 1 mod n, or 1 if no such number exists.
- Smallest m in range 2..n-1 such that m^5 == 1 mod n, or 1 if no such number exists.A070670
Smallest m in range 2..n-1 such that m^5 == 1 mod n, or 1 if no such number exists.
- Smallest m in range 2..n-1 such that m^6 == 1 mod n, or 1 if no such number exists.A070671
Smallest m in range 2..n-1 such that m^6 == 1 mod n, or 1 if no such number exists.
- Smallest m in range 2..n-1 such that m^7 == 1 mod n, or 1 if no such number exists.A070672
Smallest m in range 2..n-1 such that m^7 == 1 mod n, or 1 if no such number exists.
- Smallest m in range 2..n-1 such that m^8 == 1 mod n, or 1 if no such number exists.A070673
Smallest m in range 2..n-1 such that m^8 == 1 mod n, or 1 if no such number exists.
- Smallest m in range 2..n-1 such that m^9 == 1 mod n, or 1 if no such number exists.A070674
Smallest m in range 2..n-1 such that m^9 == 1 mod n, or 1 if no such number exists.
- Smallest m in range 2..n-1 such that m^10 == 1 mod n, or 1 if no such number exists.A070675
Smallest m in range 2..n-1 such that m^10 == 1 mod n, or 1 if no such number exists.
- Smallest m in range 1..phi(n) such that 3^m == 1 mod n, or 0 if no such number exists.A070676
Smallest m in range 1..phi(n) such that 3^m == 1 mod n, or 0 if no such number exists.
- Smallest m in range 1..phi(n) such that 5^m == 1 mod n, or 0 if no such number exists.A070677
Smallest m in range 1..phi(n) such that 5^m == 1 mod n, or 0 if no such number exists.
- Smallest m in range 1..phi(n) such that 7^m == 1 mod n, or 0 if no such number exists.A070678
Smallest m in range 1..phi(n) such that 7^m == 1 mod n, or 0 if no such number exists.
- Smallest m in range 1..phi(n) such that 9^m == 1 mod n, or 0 if no such number exists.A070679
Smallest m in range 1..phi(n) such that 9^m == 1 mod n, or 0 if no such number exists.
- Smallest m in range 1..phi(n) such that 11^m == 1 mod n, or 0 if no such number exists.A070680
Smallest m in range 1..phi(n) such that 11^m == 1 mod n, or 0 if no such number exists.
- Smallest m in range 1..phi(2n+1) such that 6^m == 1 mod 2n+1, or 0 if no such number exists.A070681
Smallest m in range 1..phi(2n+1) such that 6^m == 1 mod 2n+1, or 0 if no such number exists.
- Smallest m in range 1..phi(2n+1) such that 10^m == 1 mod 2n+1, or 0 if no such number exists.A070682
Smallest m in range 1..phi(2n+1) such that 10^m == 1 mod 2n+1, or 0 if no such number exists.
- Smallest m in range 1..phi(2n+1) such that 12^m == 1 mod 2n+1, or 0 if no such number exists.A070683
Smallest m in range 1..phi(2n+1) such that 12^m == 1 mod 2n+1, or 0 if no such number exists.
- n^6 mod 44.A070684
n^6 mod 44.
- n^6 mod 45.A070685
n^6 mod 45.
- n^6 mod 46.A070686
n^6 mod 46.
- n^6 mod 47.A070687
n^6 mod 47.
- a(n) = n^6 mod 48.A070688
a(n) = n^6 mod 48.
- Numbers k such that k+1 and k^2+1 are primes.A070689
Numbers k such that k+1 and k^2+1 are primes.
- Duplicate of A070471.A070690
Duplicate of A070471.
- (Sum of digits of n)^n.A070691
(Sum of digits of n)^n.
- a(n) = n^7 mod 9.A070692
a(n) = n^7 mod 9.
- a(n) = n^7 mod 11.A070693
a(n) = n^7 mod 11.
- Numbers b such that b+1, b^2+1, b^4+1, b^8+1 and b^16+1 are primes.A070694
Numbers b such that b+1, b^2+1, b^4+1, b^8+1 and b^16+1 are primes.
- a(n) = n^7 mod 13.A070695
a(n) = n^7 mod 13.
- a(n) = n mod 14.A070696
a(n) = n mod 14.
- Duplicate of A070477.A070697
Duplicate of A070477.
- Numbers n such that reverse(n) sets a record (that is, n such that reverse(n) > reverse(k) for all k < n).A070698
Numbers n such that reverse(n) sets a record (that is, n such that reverse(n) > reverse(k) for all k < n).
- a(n) = n^7 mod 17.A070699
a(n) = n^7 mod 17.
- a(n) = n^7 mod 18.A070700
a(n) = n^7 mod 18.
- a(n) = n^7 mod 19.A070701
a(n) = n^7 mod 19.
- Duplicate of A070482.A070702
Duplicate of A070482.
- a(n) = n^7 mod 22.A070703
a(n) = n^7 mod 22.
- a(n) = n^7 mod 23.A070704
a(n) = n^7 mod 23.
- LCM of first n prime powers modulo next prime power.A070705
LCM of first n prime powers modulo next prime power.
- a(n) = n^7 mod 25.A070706
a(n) = n^7 mod 25.
- n^7 mod 26.A070707
n^7 mod 26.
- n^7 mod 27.A070708
n^7 mod 27.
- n^7 mod 28.A070709
n^7 mod 28.
- n^7 mod 29.A070710
n^7 mod 29.