Sequences
392,541 sequences
- Duplicate of A070492.A070711
Duplicate of A070492.
- a(n) = n^7 mod 31.A070712
a(n) = n^7 mod 31.
- Integers whose sum of digits as well as product of digits is a nonzero square.A070713
Integers whose sum of digits as well as product of digits is a nonzero square.
- n^7 mod 33.A070714
n^7 mod 33.
- n^7 mod 34.A070715
n^7 mod 34.
- n^7 mod 35.A070716
n^7 mod 35.
- a(n) = n^7 mod 36.A070717
a(n) = n^7 mod 36.
- n^7 mod 37.A070718
n^7 mod 37.
- n^7 mod 38.A070719
n^7 mod 38.
- a(n) = n^7 mod 39.A070720
a(n) = n^7 mod 39.
- Duplicate of A070502.A070721
Duplicate of A070502.
- a(n) = n^7 mod 41.A070722
a(n) = n^7 mod 41.
- n^7 mod 43.A070723
n^7 mod 43.
- n^7 mod 44.A070724
n^7 mod 44.
- n^7 mod 45.A070725
n^7 mod 45.
- a(n) = n^7 mod 46.A070726
a(n) = n^7 mod 46.
- n^7 mod 47.A070727
n^7 mod 47.
- n^7 mod 48.A070728
n^7 mod 48.
- Common British Royal Mint coinage (in pence) from smallest physical size to largest, as of May 13 2002.A070729
Common British Royal Mint coinage (in pence) from smallest physical size to largest, as of May 13 2002.
- Euro coinage (in cents) from smallest physical size to largest.A070730
Euro coinage (in cents) from smallest physical size to largest.
- Size of largest conjugacy class in the group GL(n,2).A070731
Size of largest conjugacy class in the group GL(n,2).
- Size of largest conjugacy class in the group GL(2,Z_n).A070732
Size of largest conjugacy class in the group GL(2,Z_n).
- Size of largest conjugacy class in A_n, the alternating group on n symbols.A070733
Size of largest conjugacy class in A_n, the alternating group on n symbols.
- Order of the subgroup of the symmetric group S_n generated by the cycles (1,2,3) and (1,2,3,...,n).A070734
Order of the subgroup of the symmetric group S_n generated by the cycles (1,2,3) and (1,2,3,...,n).
- Let r, s, t be three permutations of the set { 1, 2, 3, ..., n }; a(n) = minimal value of Sum_{i=1..n} r(i)*s(i)*t(i).A070735
Let r, s, t be three permutations of the set { 1, 2, 3, ..., n }; a(n) = minimal value of Sum_{i=1..n} r(i)*s(i)*t(i).
- Let r, s, t, u be four permutations of the set { 1, 2, 3, ..., n }; a(n) = minimal value of Sum_{i=1..n} r(i)*s(i)*t(i)*u(i).A070736
Let r, s, t, u be four permutations of the set { 1, 2, 3, ..., n }; a(n) = minimal value of Sum_{i=1..n} r(i)*s(i)*t(i)*u(i).
- Smallest number x such that the first n cyclotomic polynomials evaluated at x are primes.A070737
Smallest number x such that the first n cyclotomic polynomials evaluated at x are primes.
- Nonprimes n such that n^2 reduced modulo phi(n) = phi(n)^2 reduced modulo n.A070738
Nonprimes n such that n^2 reduced modulo phi(n) = phi(n)^2 reduced modulo n.
- Primes of form 2^x + 2^y + 1.A070739
Primes of form 2^x + 2^y + 1.
- Order of the subgroup of the symmetric group S_(2n) generated by the 2 cycles: (1,2,...n,2n,2n-1,...,n+1) and (1,2,...,2n).A070740
Order of the subgroup of the symmetric group S_(2n) generated by the 2 cycles: (1,2,...n,2n,2n-1,...,n+1) and (1,2,...,2n).
- z such that the Diophantine equation x^3+y^4=z^3 has solutions.A070741
z such that the Diophantine equation x^3+y^4=z^3 has solutions.
- a(n) = index of the (presumably) last palindrome in the 'Reverse and Add' trajectory of n, or -1 if this number is not finite, or 0 if no palindrome exists.A070742
a(n) = index of the (presumably) last palindrome in the 'Reverse and Add' trajectory of n, or -1 if this number is not finite, or 0 if no palindrome exists.
- n sets a new record for the index of the (presumably) last palindrome in the 'Reverse and Add' trajectory of n.A070743
n sets a new record for the index of the (presumably) last palindrome in the 'Reverse and Add' trajectory of n.
- Records for the index of the (presumably) last palindrome in the 'Reverse and Add' trajectory of n.A070744
Records for the index of the (presumably) last palindrome in the 'Reverse and Add' trajectory of n.
- Numbers z such that the Diophantine equation x^2 + y^3 = z^2 has solutions with x, y > 0.A070745
Numbers z such that the Diophantine equation x^2 + y^3 = z^2 has solutions with x, y > 0.
- Numbers k such that k 1's followed by k is a prime.A070746
Numbers k such that k 1's followed by k is a prime.
- a(n) = signum(sin(n)), where signum=A057427.A070747
a(n) = signum(sin(n)), where signum=A057427.
- a(n) = signum(sin(prime(n))), where signum=A057427, prime=A000040.A070748
a(n) = signum(sin(prime(n))), where signum=A057427, prime=A000040.
- Nearest integer to sin(prime(n)), prime=A000040.A070749
Nearest integer to sin(prime(n)), prime=A000040.
- 0 if n-th prime is even, 1 if n-th prime is == 1 (mod 4), and -1 if n-th prime is == 3 (mod 4).A070750
0 if n-th prime is even, 1 if n-th prime is == 1 (mod 4), and -1 if n-th prime is == 3 (mod 4).
- Numbers n such that sin(n) < 0.A070751
Numbers n such that sin(n) < 0.
- Numbers k such that sin(k) > 0.A070752
Numbers k such that sin(k) > 0.
- Primes p such that sin(p) < 0.A070753
Primes p such that sin(p) < 0.
- Primes p such that sin(p) > 0.A070754
Primes p such that sin(p) > 0.
- Squarefree tetrahedral numbers.A070755
Squarefree tetrahedral numbers.
- Numbers n such that the Diophantine equation x^4+y^5=n^4 has solutions.A070756
Numbers n such that the Diophantine equation x^4+y^5=n^4 has solutions.
- Number of ways to write 4n as a sum of 4 primes.A070757
Number of ways to write 4n as a sum of 4 primes.
- Values of floor((3/2)^n) that are composite.A070758
Values of floor((3/2)^n) that are composite.
- n for which floor((3/2)^n) is prime.A070759
n for which floor((3/2)^n) is prime.
- Numbers k such that k*rev(k) is a square different from k^2, where rev=A004086, decimal reversal.A070760
Numbers k such that k*rev(k) is a square different from k^2, where rev=A004086, decimal reversal.