Sequences
392,541 sequences
- Number of ways writing n! as a sum of two primes.A062311
Number of ways writing n! as a sum of two primes.
- Nonprime numbers squared.A062312
Nonprime numbers squared.
- Factorials of nonprime numbers.A062313
Factorials of nonprime numbers.
- Number of cyclic subgroups of the group SL(n,3) (the group of nonsingular n X n matrices over GF(3) with determinant 1 ).A062314
Number of cyclic subgroups of the group SL(n,3) (the group of nonsingular n X n matrices over GF(3) with determinant 1 ).
- Number of cyclic subgroups of the group SL(n,4) (the group of nonsingular n X n matrices over GF(4) with determinant 1 ).A062315
Number of cyclic subgroups of the group SL(n,4) (the group of nonsingular n X n matrices over GF(4) with determinant 1 ).
- Neither the sum or difference of 2 squares.A062316
Neither the sum or difference of 2 squares.
- Numbers k such that 5*k-1 is a perfect square.A062317
Numbers k such that 5*k-1 is a perfect square.
- Numbers of the form 3^m - 1 or 2*3^m - 1; i.e., the union of sequences A048473 and A024023.A062318
Numbers of the form 3^m - 1 or 2*3^m - 1; i.e., the union of sequences A048473 and A024023.
- Number of divisors of n^n, or of A000312(n).A062319
Number of divisors of n^n, or of A000312(n).
- Nonsquarefree numbers squared. A013929(n)^2.A062320
Nonsquarefree numbers squared. A013929(n)^2.
- a(1) = 1; a(n) = gcd {n*(n+1), a(n-1) * (a(n-1) + 1)} for n > 1.A062321
a(1) = 1; a(n) = gcd {n*(n+1), a(n-1) * (a(n-1) + 1)} for n > 1.
- Factorials of nonsquarefree numbers, or A013929(n)!, (including 1).A062322
Factorials of nonsquarefree numbers, or A013929(n)!, (including 1).
- Triangle with a(n,n)=1, a(n,k)=(n-1)*a(n-1,k)+a(n-2,k) for n>k.A062323
Triangle with a(n,n)=1, a(n,k)=(n-1)*a(n-1,k)+a(n-2,k) for n>k.
- Primes p such that p^2 + 4 is also prime.A062324
Primes p such that p^2 + 4 is also prime.
- Numbers k for which phi(prime(k)) is a square.A062325
Numbers k for which phi(prime(k)) is a square.
- Primes p such that p^2 - 2 is also prime.A062326
Primes p such that p^2 - 2 is also prime.
- Number of divisors of n over the Gaussian integers.A062327
Number of divisors of n over the Gaussian integers.
- Length of period of continued fraction expansion of square root of 3^n+1.A062328
Length of period of continued fraction expansion of square root of 3^n+1.
- a(n) = (sum of digits of n) - (product of digits of n).A062329
a(n) = (sum of digits of n) - (product of digits of n).
- a(n) = product of the sum and product of the digits of a(n-1) (0 is not to be considered a factor in the product).A062330
a(n) = product of the sum and product of the digits of a(n-1) (0 is not to be considered a factor in the product).
- a(n) is the product of the sum and the product of the digits of n (0 is not to be considered a factor in the product).A062331
a(n) is the product of the sum and the product of the digits of n (0 is not to be considered a factor in the product).
- Primes starting and ending with 1.A062332
Primes starting and ending with 1.
- Primes starting and ending with 3.A062333
Primes starting and ending with 3.
- Primes starting and ending with 7.A062334
Primes starting and ending with 7.
- Primes starting and ending with 9.A062335
Primes starting and ending with 9.
- Primes whose sum of digits is a multiple of 7.A062336
Primes whose sum of digits is a multiple of 7.
- Primes whose sum of digits is 7.A062337
Primes whose sum of digits is 7.
- Primes whose sum of digits is a multiple of 4.A062338
Primes whose sum of digits is a multiple of 4.
- Primes whose sum of digits is 4.A062339
Primes whose sum of digits is 4.
- Primes whose sum of digits is a multiple of 5.A062340
Primes whose sum of digits is a multiple of 5.
- Primes whose sum of digits is 5.A062341
Primes whose sum of digits is 5.
- Primes whose sum of digits is a multiple of 8.A062342
Primes whose sum of digits is a multiple of 8.
- Primes whose sum of digits is 8.A062343
Primes whose sum of digits is 8.
- Triangle of binomial(2*n, k) with n >= k.A062344
Triangle of binomial(2*n, k) with n >= k.
- Length of period of continued fraction expansion of square root of 3^n-1.A062345
Length of period of continued fraction expansion of square root of 3^n-1.
- Consider 2n tennis players; a(n) is the number of matches needed to let every possible pair play each other.A062346
Consider 2n tennis players; a(n) is the number of matches needed to let every possible pair play each other.
- a(n) = (product of first n primes) modulo prime(n+1).A062347
a(n) = (product of first n primes) modulo prime(n+1).
- a(n) = n! / (number of distinct prime divisors of n).A062348
a(n) = n! / (number of distinct prime divisors of n).
- a(n) = n! / (number of prime divisors of n, counted with multiplicity).A062349
a(n) = n! / (number of prime divisors of n, counted with multiplicity).
- Primes having only {1, 2, 3} as digits.A062350
Primes having only {1, 2, 3} as digits.
- Palindromic primes with strictly increasing digits up to the middle and then strictly decreasing.A062351
Palindromic primes with strictly increasing digits up to the middle and then strictly decreasing.
- Palindromic primes with strictly decreasing digits up to the middle and then strictly increasing.A062352
Palindromic primes with strictly decreasing digits up to the middle and then strictly increasing.
- Primes of the form bbbbba... where a and b are digits.A062353
Primes of the form bbbbba... where a and b are digits.
- a(n) = sigma(n)*phi(n).A062354
a(n) = sigma(n)*phi(n).
- a(n) = d(n) * phi(n), where d(n) is the number of divisors function.A062355
a(n) = d(n) * phi(n), where d(n) is the number of divisors function.
- a(n) = floor(n/phi(n)).A062356
a(n) = floor(n/phi(n)).
- a(n) = n*p(n+1)-(n+1)*p(n) = n*d(n)-p(n), where p(n) is the n-th prime and d(n) is the n-th prime-difference, A001223(n).A062357
a(n) = n*p(n+1)-(n+1)*p(n) = n*d(n)-p(n), where p(n) is the n-th prime and d(n) is the n-th prime-difference, A001223(n).
- a(n) = n! / d(n), where d(n) is the number of divisors of n.A062358
a(n) = n! / d(n), where d(n) is the number of divisors of n.
- a(n) = floor(n!/sigma(n)).A062359
a(n) = floor(n!/sigma(n)).
- a(n) = floor(e^(n*Pi)).A062360
a(n) = floor(e^(n*Pi)).