Sequences
392,541 sequences
- Numbers k such that Q(sqrt(-k)) has class number 10.A055111
Numbers k such that Q(sqrt(-k)) has class number 10.
- a(n) = n*(n+1)*(2*n+1).A055112
a(n) = n*(n+1)*(2*n+1).
- Number of bracketings of 0^0^0^...^0, with n 0's, giving the result 0, with conventions that 0^0 = 1^0 = 1^1 = 1, 0^1 = 0.A055113
Number of bracketings of 0^0^0^...^0, with n 0's, giving the result 0, with conventions that 0^0 = 1^0 = 1^1 = 1, 0^1 = 0.
- Numbers k such that the continued fraction for m/k contains a term >= 3 for every 1 <= m < k.A055114
Numbers k such that the continued fraction for m/k contains a term >= 3 for every 1 <= m < k.
- Base-5 complement of n (write n in base 5, then replace each digit with its base-5 negative).A055115
Base-5 complement of n (write n in base 5, then replace each digit with its base-5 negative).
- Base-6 complement of n (write n in base 6, then replace each digit with its base-6 negative).A055116
Base-6 complement of n (write n in base 6, then replace each digit with its base-6 negative).
- Base-7 complement of n (write n in base 7, then replace each digit with its base-7 negative).A055117
Base-7 complement of n (write n in base 7, then replace each digit with its base-7 negative).
- Base-8 complement of n (write n in base 8, then replace each digit with its base-8 negative).A055118
Base-8 complement of n (write n in base 8, then replace each digit with its base-8 negative).
- Base-9 complement of n (write n in base 9, then replace each digit with its base-9 negative).A055119
Base-9 complement of n (write n in base 9, then replace each digit with its base-9 negative).
- Digital complement of n (replace each nonzero digit d with 10-d).A055120
Digital complement of n (replace each nonzero digit d with 10-d).
- Base-11 complement of n (write n in base 11, then replace each digit with its base-11 negative).A055121
Base-11 complement of n (write n in base 11, then replace each digit with its base-11 negative).
- Base-12 complement of n (write n in base 12, then replace each digit with its base-12 negative).A055122
Base-12 complement of n (write n in base 12, then replace each digit with its base-12 negative).
- Base-13 complement of n (write n in base 13, then replace each digit with its base-13 negative).A055123
Base-13 complement of n (write n in base 13, then replace each digit with its base-13 negative).
- Base-14 complement of n (write n in base 14, then replace each digit with its base-14 negative).A055124
Base-14 complement of n (write n in base 14, then replace each digit with its base-14 negative).
- Base-15 complement of n (write n in base 15, then replace each digit with its base-15 negative).A055125
Base-15 complement of n (write n in base 15, then replace each digit with its base-15 negative).
- Base-16 complement of n (write n in base 16, then replace each digit with its base-16 negative).A055126
Base-16 complement of n (write n in base 16, then replace each digit with its base-16 negative).
- Triangle T(n,k) of numbers of proper k-covers of an unlabeled n-set, k=1..2^n-2.A055127
Triangle T(n,k) of numbers of proper k-covers of an unlabeled n-set, k=1..2^n-2.
- Fixed points of the following function: if n = Product p(i)^r(i) then f(n) = Product (-2+p(i)^(r(i)-1)+p(i)^r(i)).A055128
Fixed points of the following function: if n = Product p(i)^r(i) then f(n) = Product (-2+p(i)^(r(i)-1)+p(i)^r(i)).
- Repunits in different bases: table by antidiagonals of numbers written in base k as a string of n 1's.A055129
Repunits in different bases: table by antidiagonals of numbers written in base k as a string of n 1's.
- Triangle T(n,k) of numbers of k-covers of an unlabeled n-set, k=1..2^n-1.A055130
Triangle T(n,k) of numbers of k-covers of an unlabeled n-set, k=1..2^n-1.
- Those composite s for which A055095[s] = 2.A055131
Those composite s for which A055095[s] = 2.
- Moebius function (A008683) applied to each term in the triangle A055096.A055132
Moebius function (A008683) applied to each term in the triangle A055096.
- Matrix inverse of A008459 (squares of entries of Pascal's triangle).A055133
Matrix inverse of A008459 (squares of entries of Pascal's triangle).
- Triangle read by rows: T(n,k) = number of labeled endofunctions on n points with k fixed points.A055134
Triangle read by rows: T(n,k) = number of labeled endofunctions on n points with k fixed points.
- Matrix inverse of triangle A055134.A055135
Matrix inverse of triangle A055134.
- Triangle: a(n,k) = A055135(n,k)/C(n,k).A055136
Triangle: a(n,k) = A055135(n,k)/C(n,k).
- Regard triangle of rencontres numbers (see A008290) as infinite matrix, compute inverse, read by rows.A055137
Regard triangle of rencontres numbers (see A008290) as infinite matrix, compute inverse, read by rows.
- Matrix inverse of Losanitsch's triangle A034851.A055138
Matrix inverse of Losanitsch's triangle A034851.
- Column 0 of triangle A055138.A055139
Column 0 of triangle A055138.
- Triangle read by rows: T(n, k) = number of matchings of 2n people with partners (of either sex) such that exactly k couples are left together.A055140
Triangle read by rows: T(n, k) = number of matchings of 2n people with partners (of either sex) such that exactly k couples are left together.
- Matrix inverse of triangle A055140.A055141
Matrix inverse of triangle A055140.
- Expansion of e.g.f.: exp(x)*sqrt(1-2x).A055142
Expansion of e.g.f.: exp(x)*sqrt(1-2x).
- The first n digits of the juxtaposition of the base-2 numbers converted to decimal.A055143
The first n digits of the juxtaposition of the base-2 numbers converted to decimal.
- The first n digits of the juxtaposition of the base-3 numbers converted to decimal.A055144
The first n digits of the juxtaposition of the base-3 numbers converted to decimal.
- The first n digits of the juxtaposition of the base-4 numbers converted to decimal.A055145
The first n digits of the juxtaposition of the base-4 numbers converted to decimal.
- The first n digits of the juxtaposition of the base-5 numbers converted to decimal.A055146
The first n digits of the juxtaposition of the base-5 numbers converted to decimal.
- The first n digits of the juxtaposition of the base-6 numbers converted to decimal.A055147
The first n digits of the juxtaposition of the base-6 numbers converted to decimal.
- The first n digits of the juxtaposition of the base-7 numbers converted to decimal.A055148
The first n digits of the juxtaposition of the base-7 numbers converted to decimal.
- The first n digits of the juxtaposition of the base-8 numbers converted to decimal.A055149
The first n digits of the juxtaposition of the base-8 numbers converted to decimal.
- The first n digits of the juxtaposition of the base 9 numbers converted to decimal.A055150
The first n digits of the juxtaposition of the base 9 numbers converted to decimal.
- Triangular array of Motzkin polynomial coefficients.A055151
Triangular array of Motzkin polynomial coefficients.
- Proper covers of an unlabeled n-set.A055152
Proper covers of an unlabeled n-set.
- Numbers k such that sigma(k) = 7k/2.A055153
Numbers k such that sigma(k) = 7k/2.
- Triangle read by rows: T(n,k) = number of k-covers of a labeled n-set, k=1..2^n-1.A055154
Triangle read by rows: T(n,k) = number of k-covers of a labeled n-set, k=1..2^n-1.
- a(n) = Sum_{d|n} gcd(d, n/d).A055155
a(n) = Sum_{d|n} gcd(d, n/d).
- Powers of 3 which are not powers of 3^3.A055156
Powers of 3 which are not powers of 3^3.
- n has distinct digits and n=a-b where a has the digits of n in descending order and b has the digits of n in ascending order (perhaps with leading zeros).A055157
n has distinct digits and n=a-b where a has the digits of n in descending order and b has the digits of n in ascending order (perhaps with leading zeros).
- n has distinct digits in descending order and n=a+b where a has the digits of n in another order and b has the digits of n in ascending order (perhaps with leading zeros).A055158
n has distinct digits in descending order and n=a+b where a has the digits of n in another order and b has the digits of n in ascending order (perhaps with leading zeros).
- n has distinct digits in ascending order and n=a-b where a has the digits of n in descending order and b has the digits of n in another order (a and b perhaps with extra zeros).A055159
n has distinct digits in ascending order and n=a-b where a has the digits of n in descending order and b has the digits of n in another order (a and b perhaps with extra zeros).
- Numbers n with the property that n=a-b where a has the digits of n in descending order and b has the digits of n in ascending order (perhaps with leading zeros), ordered by a.A055160
Numbers n with the property that n=a-b where a has the digits of n in descending order and b has the digits of n in ascending order (perhaps with leading zeros), ordered by a.