Sequences
392,541 sequences
- Duplicate of A070431.A070511
Duplicate of A070431.
- a(n) = n^4 mod 7.A070512
a(n) = n^4 mod 7.
- a(n) = n^4 mod 9.A070513
a(n) = n^4 mod 9.
- Final digit of n^4: a(n) = n^4 mod 10.A070514
Final digit of n^4: a(n) = n^4 mod 10.
- a(n) = n^4 mod 11.A070515
a(n) = n^4 mod 11.
- Duplicate of A070435.A070516
Duplicate of A070435.
- a(n) = n^4 mod 13.A070517
a(n) = n^4 mod 13.
- Value of n-th cyclotomic polynomial at n.A070518
Value of n-th cyclotomic polynomial at n.
- Numbers k such that Cyclotomic(k,k) (i.e., the value of k-th cyclotomic polynomial at k) is a prime number.A070519
Numbers k such that Cyclotomic(k,k) (i.e., the value of k-th cyclotomic polynomial at k) is a prime number.
- Prime numbers of form p=Cyclotomic(n,n).A070520
Prime numbers of form p=Cyclotomic(n,n).
- Value of prime(n)-th cyclotomic polynomial at n.A070521
Value of prime(n)-th cyclotomic polynomial at n.
- Value of n-th cyclotomic polynomial at the n-th prime.A070522
Value of n-th cyclotomic polynomial at the n-th prime.
- Numbers k such that cyclotomic(k, prime(k)) is a prime number.A070523
Numbers k such that cyclotomic(k, prime(k)) is a prime number.
- Value of n-th cyclotomic polynomial at phi(n).A070524
Value of n-th cyclotomic polynomial at phi(n).
- Numbers n such that n-th cyclotomic polynomial evaluated at phi(n) is a prime number.A070525
Numbers n such that n-th cyclotomic polynomial evaluated at phi(n) is a prime number.
- Value of n-th cyclotomic polynomial at 2^n.A070526
Value of n-th cyclotomic polynomial at 2^n.
- Numbers k such that cyclotomic(k, 2^k) is a prime number.A070527
Numbers k such that cyclotomic(k, 2^k) is a prime number.
- Number of divisors of 10^n-1 (999...999 with n digits).A070528
Number of divisors of 10^n-1 (999...999 with n digits).
- Number of divisors of repunit 111...111 (with n digits).A070529
Number of divisors of repunit 111...111 (with n digits).
- Primes of form Cyclotomic[n,2^n].A070530
Primes of form Cyclotomic[n,2^n].
- Generalized Bell numbers B_{4,3}.A070531
Generalized Bell numbers B_{4,3}.
- a(n) = n^4 mod 14.A070532
a(n) = n^4 mod 14.
- a(n) = n^4 mod 15.A070533
a(n) = n^4 mod 15.
- a(n) = n^4 mod 17.A070534
a(n) = n^4 mod 17.
- a(n) = n^4 mod 18.A070535
a(n) = n^4 mod 18.
- Number of terms in n-th cyclotomic polynomial minus largest prime factor of n; a(1)=1 by convention.A070536
Number of terms in n-th cyclotomic polynomial minus largest prime factor of n; a(1)=1 by convention.
- Numbers k such that the k-th cyclotomic polynomial has more terms than the largest prime factor of k.A070537
Numbers k such that the k-th cyclotomic polynomial has more terms than the largest prime factor of k.
- a(n) = n^4 mod 19.A070538
a(n) = n^4 mod 19.
- a(n) = n^4 mod 20.A070539
a(n) = n^4 mod 20.
- a(n) = n^4 mod 21.A070540
a(n) = n^4 mod 21.
- a(n) = n^4 mod 22.A070541
a(n) = n^4 mod 22.
- Numbers n such that binomial(2n,n) does not have two prime factors that add to 2n.A070542
Numbers n such that binomial(2n,n) does not have two prime factors that add to 2n.
- Triangular array read by rows: T(n,k) = number of k-dimensional isotropic subspaces of Spin(2n+1,C), n >= 1, 1 <= k <= n.A070543
Triangular array read by rows: T(n,k) = number of k-dimensional isotropic subspaces of Spin(2n+1,C), n >= 1, 1 <= k <= n.
- Number of squarefree numbers s such that n < s < 2n.A070544
Number of squarefree numbers s such that n < s < 2n.
- a(n) = Card( k, 0<k<=n such that k is relatively prime to sigma(k)).A070545
a(n) = Card( k, 0<k<=n such that k is relatively prime to sigma(k)).
- a(n) = Card( k, 0<k<=n such that k is relatively prime to tau(k)=A000005(k)).A070546
a(n) = Card( k, 0<k<=n such that k is relatively prime to tau(k)=A000005(k)).
- a(n) = Card(k, 0<k<n such that phi(k) divides phi(n-k)).A070547
a(n) = Card(k, 0<k<n such that phi(k) divides phi(n-k)).
- a(n) = Cardinality{ k in range 1 <= k <= n such that Moebius(k) = 1 }.A070548
a(n) = Cardinality{ k in range 1 <= k <= n such that Moebius(k) = 1 }.
- a(n) = Cardinality{ k in range 1 <= k <= n such that Moebius(k) = -1 }.A070549
a(n) = Cardinality{ k in range 1 <= k <= n such that Moebius(k) = -1 }.
- a(n) = a(n-1) + a(n-3) + a(n-4), starting with a(0..3) = 1, 2, 2, 3.A070550
a(n) = a(n-1) + a(n-3) + a(n-4), starting with a(0..3) = 1, 2, 2, 3.
- a(n) = n^4 mod 23.A070551
a(n) = n^4 mod 23.
- Semiprimes k such that k+1 is also a semiprime.A070552
Semiprimes k such that k+1 is also a semiprime.
- Rectangular array read by rows: n-th row gives the 7 numbers k*10^n mod 7 for 0 <= k < 7.A070553
Rectangular array read by rows: n-th row gives the 7 numbers k*10^n mod 7 for 0 <= k < 7.
- Number of positive integers, k, where k <= 2n+1 and gcd(k, 2n+1) = gcd(k+1, 2n+1) = 1.A070554
Number of positive integers, k, where k <= 2n+1 and gcd(k, 2n+1) = gcd(k+1, 2n+1) = 1.
- Sum of positive integers k, where k <= n and gcd(k,2n+1) = gcd(k+1,2n+1).A070555
Sum of positive integers k, where k <= n and gcd(k,2n+1) = gcd(k+1,2n+1).
- a(n) = cototient(totient(n)).A070556
a(n) = cototient(totient(n)).
- Number of two-rowed partitions of length 4.A070557
Number of two-rowed partitions of length 4.
- Number of two-rowed partitions of length 5.A070558
Number of two-rowed partitions of length 5.
- Number of two-rowed partitions of length 6.A070559
Number of two-rowed partitions of length 6.
- a(0) = 1; for n > 0, a(n) = (fecundity of n) + 2.A070560
a(0) = 1; for n > 0, a(n) = (fecundity of n) + 2.