Sequences
392,541 sequences
- Largest prime associated with A053095(n), or zero if no such prime exists.A053161
Largest prime associated with A053095(n), or zero if no such prime exists.
- Nonprimes n such that n+cototient(n) is a power of 2.A053162
Nonprimes n such that n+cototient(n) is a power of 2.
- n+cototient(n) produces these powers of 2 in order of magnitude.A053163
n+cototient(n) produces these powers of 2 in order of magnitude.
- 4th root of largest 4th power dividing n.A053164
4th root of largest 4th power dividing n.
- 4th-power-free part of n.A053165
4th-power-free part of n.
- Smallest positive integer for which n divides a(n)^4.A053166
Smallest positive integer for which n divides a(n)^4.
- Smallest 4th power divisible by n.A053167
Smallest 4th power divisible by n.
- Hamming weights (or nonlinearity) of degree 4 rotation-symmetric functions.A053168
Hamming weights (or nonlinearity) of degree 4 rotation-symmetric functions.
- A paradoxical sequence: a positive integer n is in this sequence if and only if n is not in sequence A_n in the database.A053169
A paradoxical sequence: a positive integer n is in this sequence if and only if n is not in sequence A_n in the database.
- Number of 3 X 3 integer matrices with elements in the range [ -n,n ] which generate a group of finite order under matrix multiplication.A053170
Number of 3 X 3 integer matrices with elements in the range [ -n,n ] which generate a group of finite order under matrix multiplication.
- Number of 3 X 3 integer matrices with elements in the range [ -n,n ] which represent a rotation of order 2.A053171
Number of 3 X 3 integer matrices with elements in the range [ -n,n ] which represent a rotation of order 2.
- Number of 3 X 3 integer matrices with elements in the range [ -n,n ] which represent a three-fold rotation.A053172
Number of 3 X 3 integer matrices with elements in the range [ -n,n ] which represent a three-fold rotation.
- Number of 3 X 3 integer matrices with elements in the range [ -n,n ] which represent a four-fold rotation. Also the sequence for the corresponding four-fold rotoinversions.A053173
Number of 3 X 3 integer matrices with elements in the range [ -n,n ] which represent a four-fold rotation. Also the sequence for the corresponding four-fold rotoinversions.
- Number of 3 X 3 integer matrices with elements in the range [ -n,n ] which represent a six-fold rotation. Also the sequence for the corresponding six-fold rotoinversions.A053174
Number of 3 X 3 integer matrices with elements in the range [ -n,n ] which represent a six-fold rotation. Also the sequence for the corresponding six-fold rotoinversions.
- Catalan-Larcombe-French sequence.A053175
Catalan-Larcombe-French sequence.
- Primes p such that 2p+1 is composite.A053176
Primes p such that 2p+1 is composite.
- Odd composite k such that (k-1)/2 is prime.A053177
Odd composite k such that (k-1)/2 is prime.
- Numbers ending in 1 which are not prime.A053178
Numbers ending in 1 which are not prime.
- Numbers ending in 3 which are not prime.A053179
Numbers ending in 3 which are not prime.
- Numbers ending in 7 which are not prime.A053180
Numbers ending in 7 which are not prime.
- Composite numbers ending in 9.A053181
Composite numbers ending in 9.
- Primes p such that p^2 + p + 1 is prime.A053182
Primes p such that p^2 + p + 1 is prime.
- Primes of the form p^2 + p + 1 when p is prime.A053183
Primes of the form p^2 + p + 1 when p is prime.
- Primes p such that p^2+p-1 is prime.A053184
Primes p such that p^2+p-1 is prime.
- Primes of the form p^2 + p - 1 when p is prime.A053185
Primes of the form p^2 + p - 1 when p is prime.
- Square excess of n: difference between n and largest square <= n.A053186
Square excess of n: difference between n and largest square <= n.
- Square nearest to n.A053187
Square nearest to n.
- Distance from n to nearest square.A053188
Distance from n to nearest square.
- Hamming weights (or nonlinearity) of degree 5 rotation-symmetric functions.A053189
Hamming weights (or nonlinearity) of degree 5 rotation-symmetric functions.
- a(n) is the numerator of the n-th convergent of [L_1, L_2, L_3, ...] where L_i is the period of the continued fraction for sqrt(i).A053190
a(n) is the numerator of the n-th convergent of [L_1, L_2, L_3, ...] where L_i is the period of the continued fraction for sqrt(i).
- a(n) = n^2 * phi(n).A053191
a(n) = n^2 * phi(n).
- a(n) is the cototient of n^3.A053192
a(n) is the cototient of n^3.
- Cototient of odd numbers.A053193
Cototient of odd numbers.
- a(n) is the smallest number k such that cototient(k) = 2n - 1.A053194
a(n) is the smallest number k such that cototient(k) = 2n - 1.
- Number of level permutations of degree n.A053195
Number of level permutations of degree n.
- Cototients of even numbers.A053196
Cototients of even numbers.
- Number of level partitions of n.A053197
Number of level partitions of n.
- Totients of consecutive pure powers of primes.A053198
Totients of consecutive pure powers of primes.
- Triangular array T: put T(n,0)=n+1 for all n >= 0 and all other T(n,k)=0; then put T(n,k)=Sum{T(i,j): 0<=j<=i-n+k, n-k<=i<=n}.A053199
Triangular array T: put T(n,0)=n+1 for all n >= 0 and all other T(n,k)=0; then put T(n,k)=Sum{T(i,j): 0<=j<=i-n+k, n-k<=i<=n}.
- Binomial coefficients C(n,k) reduced modulo n, read by rows; T(0,0)=0 by convention.A053200
Binomial coefficients C(n,k) reduced modulo n, read by rows; T(0,0)=0 by convention.
- Pascal's triangle (excluding first, last element of each row) read by rows, row n read mod n.A053201
Pascal's triangle (excluding first, last element of each row) read by rows, row n read mod n.
- Pascal's triangle (excluding first, last two elements of each row) read by rows, row n read mod n.A053202
Pascal's triangle (excluding first, last two elements of each row) read by rows, row n read mod n.
- Pascal's triangle (excluding first, last three elements of each row) read by rows, row n read mod n.A053203
Pascal's triangle (excluding first, last three elements of each row) read by rows, row n read mod n.
- Row sums of A053200.A053204
Row sums of A053200.
- Row sums of A053201.A053205
Row sums of A053201.
- Row sums of A053203.A053206
Row sums of A053203.
- Rows of triangle formed using Pascal's rule except begin n-th row with n and end it with n+1.A053207
Rows of triangle formed using Pascal's rule except begin n-th row with n and end it with n+1.
- Row sums of A053207.A053208
Row sums of A053207.
- Row sums of A051598.A053209
Row sums of A051598.
- Row sums of A051599.A053210
Row sums of A051599.