Sequences
392,541 sequences
- Triangle read by rows: T(n,1) = number of letters in English name for n, T(n,k+1) = number of letters in T(n,k), but stop if T(n,k+1) would equal T(n,k).A081361
Triangle read by rows: T(n,1) = number of letters in English name for n, T(n,k+1) = number of letters in T(n,k), but stop if T(n,k+1) would equal T(n,k).
- Expansion of q^(1/24) * eta(q) / eta(q^2) in powers of q.A081362
Expansion of q^(1/24) * eta(q) / eta(q^2) in powers of q.
- Smallest squarefree integer k such that Q(sqrt(k)) has class number n.A081363
Smallest squarefree integer k such that Q(sqrt(k)) has class number n.
- Smallest d such that real quadratic field with discriminant d has class number n.A081364
Smallest d such that real quadratic field with discriminant d has class number n.
- Numbers whose name in American English is a word-palindrome, reading the same forward and backward.A081365
Numbers whose name in American English is a word-palindrome, reading the same forward and backward.
- Number of distinct edge lengths in the convex hull of the maximal volume arrangements of n points on a sphere.A081366
Number of distinct edge lengths in the convex hull of the maximal volume arrangements of n points on a sphere.
- E.g.f.: exp(2*x)/sqrt(1-2*x).A081367
E.g.f.: exp(2*x)/sqrt(1-2*x).
- Next n digits of e, base of the natural logarithms.A081368
Next n digits of e, base of the natural logarithms.
- Binomial(n^2, n) reduced mod n^2.A081369
Binomial(n^2, n) reduced mod n^2.
- Numbers k such that binomial(k^2, k) reduced mod k^2 is 0.A081370
Numbers k such that binomial(k^2, k) reduced mod k^2 is 0.
- Binomial coefficients C(n,j) reduced modulo j, j=1,...n; read by rows, j=0 is omitted because of mod(n,0).A081371
Binomial coefficients C(n,j) reduced modulo j, j=1,...n; read by rows, j=0 is omitted because of mod(n,0).
- a(n) is the number of j from 1 to n such that binomial(n,j) is divisible by j.A081372
a(n) is the number of j from 1 to n such that binomial(n,j) is divisible by j.
- Number of values of k, 1 <= k <= n, with phi(k) = phi(n), where phi is Euler totient function, A000010.A081373
Number of values of k, 1 <= k <= n, with phi(k) = phi(n), where phi is Euler totient function, A000010.
- Size of "uniform" Hamming covers of distance 1, that is, Hamming covers in which all vectors of equal weight are treated the same, included or excluded from the cover together.A081374
Size of "uniform" Hamming covers of distance 1, that is, Hamming covers in which all vectors of equal weight are treated the same, included or excluded from the cover together.
- a(n) is the least number k such that A081373(k) = n.A081375
a(n) is the least number k such that A081373(k) = n.
- a(n) is the least number such that A067003(a(n)) = n.A081376
a(n) is the least number such that A067003(a(n)) = n.
- Numbers k such that the set of prime divisors of phi(k) is equal to the set of prime divisors of sigma(k).A081377
Numbers k such that the set of prime divisors of phi(k) is equal to the set of prime divisors of sigma(k).
- Numbers k for which the sums of prime factors (ignoring multiplicity) of sigma(k) and phi(k) are equal but the sets of prime factors of sigma and phi are different.A081378
Numbers k for which the sums of prime factors (ignoring multiplicity) of sigma(k) and phi(k) are equal but the sets of prime factors of sigma and phi are different.
- Duplicate of A081377.A081379
Duplicate of A081377.
- Numbers k such that the sets of prime factors (ignoring multiplicity) of A000203(k) = sigma(k) and of A001157(k) = sigma_2(k) are identical.A081380
Numbers k such that the sets of prime factors (ignoring multiplicity) of A000203(k) = sigma(k) and of A001157(k) = sigma_2(k) are identical.
- Numbers n such that n and tau(n) = A000005(n) have the same prime factors (ignoring multiplicity).A081381
Numbers n such that n and tau(n) = A000005(n) have the same prime factors (ignoring multiplicity).
- a(1) = 1, for n > 1 a(n) = Min{x > n, A008472(x) = A008472(n)}.A081382
a(1) = 1, for n > 1 a(n) = Min{x > n, A008472(x) = A008472(n)}.
- Least x = a(n) such that number of common prime factors (ignoring multiplicity) of sigma(x) = A000203(x) and phi(x) = A000010(x) equals n.A081383
Least x = a(n) such that number of common prime factors (ignoring multiplicity) of sigma(x) = A000203(x) and phi(x) = A000010(x) equals n.
- Numbers k such that binomial(prime(k), k) is divisible by k^2.A081384
Numbers k such that binomial(prime(k), k) is divisible by k^2.
- Incorrect version of A006254 (or A111333).A081385
Incorrect version of A006254 (or A111333).
- Number of unitary prime divisors of central binomial coefficient, C(2n,n) = A000984(n), i.e., number of those prime factors in C(2n,n), whose exponent equals one.A081386
Number of unitary prime divisors of central binomial coefficient, C(2n,n) = A000984(n), i.e., number of those prime factors in C(2n,n), whose exponent equals one.
- Number of non-unitary prime divisors of central binomial coefficient, C(2n,n) = A000984(n), i.e., number of prime factors in C(2n,n) whose exponent is greater than one.A081387
Number of non-unitary prime divisors of central binomial coefficient, C(2n,n) = A000984(n), i.e., number of prime factors in C(2n,n) whose exponent is greater than one.
- Number of unitary prime divisors of the n-th Catalan number.A081388
Number of unitary prime divisors of the n-th Catalan number.
- Number of non-unitary prime divisors of Catalan numbers, i.e., number of those prime factors whose exponent is greater than one.A081389
Number of non-unitary prime divisors of Catalan numbers, i.e., number of those prime factors whose exponent is greater than one.
- Number k such that the k-th Catalan number has only one non-unitary prime divisor; all the other prime divisors have exponent one.A081390
Number k such that the k-th Catalan number has only one non-unitary prime divisor; all the other prime divisors have exponent one.
- Numbers k such that the central binomial coefficient C(2*k,k) has only one prime divisor whose exponent exceeds one.A081391
Numbers k such that the central binomial coefficient C(2*k,k) has only one prime divisor whose exponent exceeds one.
- Numbers k such that the central binomial coefficient C(k, floor(k/2)) has only one prime divisor whose exponent is greater than one.A081392
Numbers k such that the central binomial coefficient C(k, floor(k/2)) has only one prime divisor whose exponent is greater than one.
- a(n) is the smallest k such that number of non-unitary prime divisors of central binomial coefficient, A000984(k) = C(2*k,k) equals n.A081393
a(n) is the smallest k such that number of non-unitary prime divisors of central binomial coefficient, A000984(k) = C(2*k,k) equals n.
- a(n) is the smallest k such that number of non-unitary prime divisors of central binomial coefficient, A001405(k) = C(k, floor(k/2)) equals n.A081394
a(n) is the smallest k such that number of non-unitary prime divisors of central binomial coefficient, A001405(k) = C(k, floor(k/2)) equals n.
- a(n) is the smallest value of k such that number of non-unitary prime divisors of k-th Catalan number, A000108(k) = C(2*k,k)/(k+1) equals n.A081395
a(n) is the smallest value of k such that number of non-unitary prime divisors of k-th Catalan number, A000108(k) = C(2*k,k)/(k+1) equals n.
- Number of common prime factors (ignoring multiplicity) of sigma(n) = A000203(n) and phi(n) = A000010(n).A081396
Number of common prime factors (ignoring multiplicity) of sigma(n) = A000203(n) and phi(n) = A000010(n).
- a(n) = least k such that GCD of sigma(k) = A000203(k) and phi(k) = A000010(k) equals n-th primorial = A002110(n).A081397
a(n) = least k such that GCD of sigma(k) = A000203(k) and phi(k) = A000010(k) equals n-th primorial = A002110(n).
- Numbers k for which the number of common prime factors of sigma(k) and phi(k) is exactly six (ignoring multiplicity).A081398
Numbers k for which the number of common prime factors of sigma(k) and phi(k) is exactly six (ignoring multiplicity).
- Bigomega of the n-th Catalan number: a(n) = A001222(A000108(n)).A081399
Bigomega of the n-th Catalan number: a(n) = A001222(A000108(n)).
- a(n) = d(n) - bigomega(n) - A005361(n).A081400
a(n) = d(n) - bigomega(n) - A005361(n).
- Pseudologarithm (A056239) of n!: a(n) = A056239(A000142(n)).A081401
Pseudologarithm (A056239) of n!: a(n) = A056239(A000142(n)).
- a(n) = A008475(n!).A081402
a(n) = A008475(n!).
- a(n) = A008475(n^2).A081403
a(n) = A008475(n^2).
- a(n) = A008475(prime(n)-1).A081404
a(n) = A008475(prime(n)-1).
- a(n) = (n+1)*a(n-2) with a(0) = a(1) = 1.A081405
a(n) = (n+1)*a(n-2) with a(0) = a(1) = 1.
- a(n) = (n+1)*a(n-3), a(0)=a(1)=a(2)=1 for n>1.A081406
a(n) = (n+1)*a(n-3), a(0)=a(1)=a(2)=1 for n>1.
- 4th-order non-linear ("factorial") recursion: a(0)=a(1)=a(2)=a(3)=1, a(n) = (n+1)*a(n-4).A081407
4th-order non-linear ("factorial") recursion: a(0)=a(1)=a(2)=a(3)=1, a(n) = (n+1)*a(n-4).
- a(n) = (n+1)*a(n-5), with a(0)=a(1)=a(2)=a(3)=a(4)=1.A081408
a(n) = (n+1)*a(n-5), with a(0)=a(1)=a(2)=a(3)=a(4)=1.
- a(n) = binomial(n!, lcm(1,...,n)).A081409
a(n) = binomial(n!, lcm(1,...,n)).
- a(n) = a(n-1) + a(n-2) + n (mod 3), with a(1)=a(2)=1.A081410
a(n) = a(n-1) + a(n-2) + n (mod 3), with a(1)=a(2)=1.