Sequences
392,541 sequences
- Number of divisors of n!^n! (A046882).A062961
Number of divisors of n!^n! (A046882).
- Number of divisors of n-th term of sequence a(n+1) = a(n)*(a(0) + ... + a(n)) (A001697).A062962
Number of divisors of n-th term of sequence a(n+1) = a(n)*(a(0) + ... + a(n)) (A001697).
- a(n) = mu(n) * H(n) where H(n) is A023022.A062963
a(n) = mu(n) * H(n) where H(n) is A023022.
- Pi in hexadecimal.A062964
Pi in hexadecimal.
- Positive numbers which are one less than a perfect square that is also another power.A062965
Positive numbers which are one less than a perfect square that is also another power.
- a(n) = C(3+n, n) + C(4+n, n) + C(5+n, n) + C(6+n, n).A062966
a(n) = C(3+n, n) + C(4+n, n) + C(5+n, n) + C(6+n, n).
- a(n) = 2*(sigma(n)-n-1)+1, where sigma = A000203, sum of divisors of n.A062967
a(n) = 2*(sigma(n)-n-1)+1, where sigma = A000203, sum of divisors of n.
- n + 1 - d(n), where d(n) is the number of divisors function.A062968
n + 1 - d(n), where d(n) is the number of divisors function.
- Numbers k such that abs(d(k)-k-1) is prime, where d(k) is the number of divisors of k.A062969
Numbers k such that abs(d(k)-k-1) is prime, where d(k) is the number of divisors of k.
- a(n) = 1 + Sum_{j=1..n} j^j.A062970
a(n) = 1 + Sum_{j=1..n} j^j.
- a(n) = (2*n)^n.A062971
a(n) = (2*n)^n.
- Numbers k such that the Chowla function of k is divisible by phi(k).A062972
Numbers k such that the Chowla function of k is divisible by phi(k).
- Chowla function of n is not divisible by phi(n).A062973
Chowla function of n is not divisible by phi(n).
- Numbers k such that omega(k+1) < 2*omega(k), where omega(k) is the number of distinct prime divisors of k.A062974
Numbers k such that omega(k+1) < 2*omega(k), where omega(k) is the number of distinct prime divisors of k.
- Half-totient function of n is not divisible by the number of divisors of n.A062975
Half-totient function of n is not divisible by the number of divisors of n.
- Half-totient function of n is divisible by the number of divisors of n.A062976
Half-totient function of n is divisible by the number of divisors of n.
- Difference between largest and smallest positive exponent in prime factorization of n; a(1) = 0 by convention.A062977
Difference between largest and smallest positive exponent in prime factorization of n; a(1) = 0 by convention.
- Continued fraction for Pi * (1 + sqrt 5)/2.A062978
Continued fraction for Pi * (1 + sqrt 5)/2.
- Continued fraction for 2^sqrt(2), A007507.A062979
Continued fraction for 2^sqrt(2), A007507.
- a(0) = 1, a(1) = 5; for n > 1, a(n) = 6*n*a(n-1) + Sum_{k=1..n-2} a(k)*a(n-k-1).A062980
a(0) = 1, a(1) = 5; for n > 1, a(n) = 6*n*a(n-1) + Sum_{k=1..n-2} a(k)*a(n-k-1).
- a(n) = n^phi(n).A062981
a(n) = n^phi(n).
- Numbers n such that Mertens's function of n (A002321) is divisible by phi(n).A062982
Numbers n such that Mertens's function of n (A002321) is divisible by phi(n).
- Mertens's function of n (A002321) is not divisible by phi(n).A062983
Mertens's function of n (A002321) is not divisible by phi(n).
- a(n) = M(C(n)), where M(n) is Mertens's function (A002321) and C(n) is Chowla's function (A048050).A062984
a(n) = M(C(n)), where M(n) is Mertens's function (A002321) and C(n) is Chowla's function (A048050).
- Generalized Catalan array FS(5; n,r).A062985
Generalized Catalan array FS(5; n,r).
- Coefficient array for certain polynomials N(5; k,x) (rising powers in x).A062986
Coefficient array for certain polynomials N(5; k,x) (rising powers in x).
- Row sums of unsigned N(5) staircase array A062986.A062987
Row sums of unsigned N(5) staircase array A062986.
- a(n) = binomial(n+6,5) - 1.A062988
a(n) = binomial(n+6,5) - 1.
- a(n) = C(n+6, 6) - n - 1.A062989
a(n) = C(n+6, 6) - n - 1.
- Eighth column (r=7) of FS(5) staircase array A062985.A062990
Eighth column (r=7) of FS(5) staircase array A062985.
- Coefficient triangle for certain polynomials N(2; n,x) (rising powers of x).A062991
Coefficient triangle for certain polynomials N(2; n,x) (rising powers of x).
- Row sums of unsigned triangle A062991.A062992
Row sums of unsigned triangle A062991.
- A triangle (lower triangular matrix) composed of Pfaff-Fuss (or Raney) sequences.A062993
A triangle (lower triangular matrix) composed of Pfaff-Fuss (or Raney) sequences.
- Eighth column of triangle A062993 (without leading zeros). A Pfaff-Fuss or 9-Raney sequence.A062994
Eighth column of triangle A062993 (without leading zeros). A Pfaff-Fuss or 9-Raney sequence.
- Doubly exponentiate the Bessel function I(0,2*sqrt(z)).A062995
Doubly exponentiate the Bessel function I(0,2*sqrt(z)).
- Numbers whose sum of digits is greater than or equal to its product of digits.A062996
Numbers whose sum of digits is greater than or equal to its product of digits.
- Numbers whose sum of digits is strictly greater than its product of digits.A062997
Numbers whose sum of digits is strictly greater than its product of digits.
- Numbers whose sum of digits is less than or equal to its product of digits.A062998
Numbers whose sum of digits is less than or equal to its product of digits.
- Numbers whose sum of the digits is strictly less than its product of digits.A062999
Numbers whose sum of the digits is strictly less than its product of digits.
- Number of paths of length n+2 originating at a corner of a 4 X 4 Boggle board.A063000
Number of paths of length n+2 originating at a corner of a 4 X 4 Boggle board.
- Number of paths of length n+2 originating at a non-corner edge of 4 X 4 Boggle board.A063001
Number of paths of length n+2 originating at a non-corner edge of 4 X 4 Boggle board.
- Number of paths of length n+2 originating at an interior vertex of 4 X 4 Boggle board.A063002
Number of paths of length n+2 originating at an interior vertex of 4 X 4 Boggle board.
- Difference between 3^n and the next larger or equal power of 2.A063003
Difference between 3^n and the next larger or equal power of 2.
- Difference between 2^n and the next larger or equal power of 3.A063004
Difference between 2^n and the next larger or equal power of 3.
- Difference between 2^n and the next smaller or equal power of 3.A063005
Difference between 2^n and the next smaller or equal power of 3.
- Coefficients in a 10-adic square root of 1.A063006
Coefficients in a 10-adic square root of 1.
- T(n,k) = binomial(n,k)*binomial(n+k,k), 0 <= k <= n, triangle read by rows.A063007
T(n,k) = binomial(n,k)*binomial(n+k,k), 0 <= k <= n, triangle read by rows.
- Canonical partition sequence (see A080577) encoded by prime factorization. The partition [p1,p2,p3,...] with p1 >= p2 >= p3 >= ... is encoded as 2^p1 * 3^p2 * 5^p3 * ... .A063008
Canonical partition sequence (see A080577) encoded by prime factorization. The partition [p1,p2,p3,...] with p1 >= p2 >= p3 >= ... is encoded as 2^p1 * 3^p2 * 5^p3 * ... .
- Write n in binary then square as if written in base 10.A063009
Write n in binary then square as if written in base 10.
- Carryless binary square of n; also Moser-de Bruijn sequence written in binary.A063010
Carryless binary square of n; also Moser-de Bruijn sequence written in binary.