Sequences
392,541 sequences
- Number of permutations in the symmetric group S_n such that the size of their conjugacy class is even.A052361
Number of permutations in the symmetric group S_n such that the size of their conjugacy class is even.
- Indices of records in length of English name of n including spaces and dashes (A052360): n such that k < n => A052360(k) < A052360(n).A052362
Indices of records in length of English name of n including spaces and dashes (A052360): n such that k < n => A052360(k) < A052360(n).
- Numbers n whose English name has a greater length (A005589) than any smaller number.A052363
Numbers n whose English name has a greater length (A005589) than any smaller number.
- Size of range of occurrences of digits in decimal expansion of Pi.A052364
Size of range of occurrences of digits in decimal expansion of Pi.
- Number of nonnegative integer 3 X 3 matrices with sum of elements equal to n, under row and column permutations.A052365
Number of nonnegative integer 3 X 3 matrices with sum of elements equal to n, under row and column permutations.
- Number of nonnegative integer 4 X 4 matrices with sum of elements equal to n, under row and column permutations.A052366
Number of nonnegative integer 4 X 4 matrices with sum of elements equal to n, under row and column permutations.
- Number of nonnegative integer 5 X 5 matrices with sum of elements equal to n, under row and column permutations.A052367
Number of nonnegative integer 5 X 5 matrices with sum of elements equal to n, under row and column permutations.
- Primes p such that p+7! is also prime.A052368
Primes p such that p+7! is also prime.
- Largest prime factor of n, where n runs through composite numbers.A052369
Largest prime factor of n, where n runs through composite numbers.
- Number of 6 X 6 binary matrices with n=0...36 ones up to row and column permutations.A052370
Number of 6 X 6 binary matrices with n=0...36 ones up to row and column permutations.
- Triangle T(n,k) of n X n binary matrices with k=0...n^2 ones up to row and column permutations.A052371
Triangle T(n,k) of n X n binary matrices with k=0...n^2 ones up to row and column permutations.
- Number of nonnegative integer 6 X 6 matrices with sum of elements equal to n, under row and column permutations.A052372
Number of nonnegative integer 6 X 6 matrices with sum of elements equal to n, under row and column permutations.
- Number of nonnegative integer 7 X 7 matrices with sum of elements equal to n, under row and column permutations.A052373
Number of nonnegative integer 7 X 7 matrices with sum of elements equal to n, under row and column permutations.
- Number of occurrences of most frequent digit in decimal expansion of Pi.A052374
Number of occurrences of most frequent digit in decimal expansion of Pi.
- Number of occurrences of least frequent digit in decimal expansion of Pi.A052375
Number of occurrences of least frequent digit in decimal expansion of Pi.
- Primes followed by a [10,2,10] prime difference pattern of A001223.A052376
Primes followed by a [10,2,10] prime difference pattern of A001223.
- Primes followed by an [8,4,8]=[d,D-d,d] prime difference pattern of A001223.A052377
Primes followed by an [8,4,8]=[d,D-d,d] prime difference pattern of A001223.
- Primes followed by a [4,2,4] prime difference pattern of A001223.A052378
Primes followed by a [4,2,4] prime difference pattern of A001223.
- Number of integers from 1 to 10^(n+1)-1 that lack 0 and 1 as a digit.A052379
Number of integers from 1 to 10^(n+1)-1 that lack 0 and 1 as a digit.
- a(n) = D is the smallest distance (D) between 2 non-overlapping prime twins differing by d=2n; these twins are [p,p+d] or [p+D,p+D+d] and p > 3.A052380
a(n) = D is the smallest distance (D) between 2 non-overlapping prime twins differing by d=2n; these twins are [p,p+d] or [p+D,p+D+d] and p > 3.
- The smallest initial prime of 2 non-overlapping d-twin primes if the distance between pairs (D) is minimal (see A052380).A052381
The smallest initial prime of 2 non-overlapping d-twin primes if the distance between pairs (D) is minimal (see A052380).
- Numbers without 0 in the decimal expansion, colloquial 'zeroless numbers'.A052382
Numbers without 0 in the decimal expansion, colloquial 'zeroless numbers'.
- Numbers without 1 as a digit.A052383
Numbers without 1 as a digit.
- Number of letters in the n-th decimal digit of Pi (in English).A052384
Number of letters in the n-th decimal digit of Pi (in English).
- a(n)*10^n are the denominators of the greedy alternating Egyptian fraction expansion of Pi - 3 of the form Sum_{n>=0} (-1)^n / (a(n)*10^n).A052385
a(n)*10^n are the denominators of the greedy alternating Egyptian fraction expansion of Pi - 3 of the form Sum_{n>=0} (-1)^n / (a(n)*10^n).
- Number of integers from 1 to 10^n-1 that lack 0 as a digit.A052386
Number of integers from 1 to 10^n-1 that lack 0 as a digit.
- Number of 3 X n binary matrices such that any 2 rows have a common 1, up to column permutations.A052387
Number of 3 X n binary matrices such that any 2 rows have a common 1, up to column permutations.
- Number of 4 X n binary matrices such that any 2 rows have a common 1, up to column permutations.A052388
Number of 4 X n binary matrices such that any 2 rows have a common 1, up to column permutations.
- Number of 4-element intersecting families (with not necessarily distinct sets) of an n-element set.A052389
Number of 4-element intersecting families (with not necessarily distinct sets) of an n-element set.
- Number of 4-element intersecting families (with not necessarily distinct sets) whose union is an n-element set.A052390
Number of 4-element intersecting families (with not necessarily distinct sets) whose union is an n-element set.
- Number of 4-element intersecting families (of distinct sets) whose union is an n-element set.A052391
Number of 4-element intersecting families (of distinct sets) whose union is an n-element set.
- T(2n+1,n), array T as in A054120.A052392
T(2n+1,n), array T as in A054120.
- Number of unlabeled ternary cacti having n triangles.A052393
Number of unlabeled ternary cacti having n triangles.
- Number of unlabeled 4-ary cacti having n polygons.A052394
Number of unlabeled 4-ary cacti having n polygons.
- Number of unlabeled asymmetric 4-ary cacti having n polygons.A052395
Number of unlabeled asymmetric 4-ary cacti having n polygons.
- (+2)-sigma perfect numbers: numbers k such that (+2)sigma(k) = 2*k, where (+2)sigma(k) = A107758(k).A052396
(+2)-sigma perfect numbers: numbers k such that (+2)sigma(k) = 2*k, where (+2)sigma(k) = A107758(k).
- Duplicate of A047889.A052397
Duplicate of A047889.
- Duplicate of A047890.A052398
Duplicate of A047890.
- Number of permutations in S_n with longest increasing subsequence of length <= 6.A052399
Number of permutations in S_n with longest increasing subsequence of length <= 6.
- Number of fully amphichiral and invertible prime knots with n crossings.A052400
Number of fully amphichiral and invertible prime knots with n crossings.
- Number of amphichiral prime knots with n crossings (A051767 + A051768 + A052400).A052401
Number of amphichiral prime knots with n crossings (A051767 + A051768 + A052400).
- Number of invertible prime knots with n crossings.A052402
Number of invertible prime knots with n crossings.
- Number of noninvertible prime knots with n crossings (A002863-A052402).A052403
Number of noninvertible prime knots with n crossings (A002863-A052402).
- Numbers without 2 as a digit.A052404
Numbers without 2 as a digit.
- Numbers without 3 as a digit.A052405
Numbers without 3 as a digit.
- Numbers without 4 as a digit.A052406
Numbers without 4 as a digit.
- Number of nonhyperbolic prime knots with n crossings (A051764+A051765).A052407
Number of nonhyperbolic prime knots with n crossings (A051764+A051765).
- Number of hyperbolic knots with n crossings (A002863 - A051764 - A051765).A052408
Number of hyperbolic knots with n crossings (A002863 - A051764 - A051765).
- a(n) = largest integer power m for which a representation of the form n = k^m exists (for some k).A052409
a(n) = largest integer power m for which a representation of the form n = k^m exists (for some k).
- Write n = m^k with m, k integers, k >= 1, then a(n) is the smallest possible choice for m.A052410
Write n = m^k with m, k integers, k >= 1, then a(n) is the smallest possible choice for m.