Sequences
392,541 sequences
- Number of orthogonal mates for the cyclic Latin squares of odd order.A091261
Number of orthogonal mates for the cyclic Latin squares of odd order.
- Sum of totient function values of powers of n, as exponent runs from 1 to n.A091262
Sum of totient function values of powers of n, as exponent runs from 1 to n.
- Inverse permutation to A091023.A091263
Inverse permutation to A091023.
- Matrix defined by a(n,k) = 2^n + (k-1), read by antidiagonals.A091264
Matrix defined by a(n,k) = 2^n + (k-1), read by antidiagonals.
- Take sequence of prime numbers (A000040) and reverse successive subsequences of lengths 1,2,3,4,...A091265
Take sequence of prime numbers (A000040) and reverse successive subsequences of lengths 1,2,3,4,...
- Number of orbits of length n under the map whose periodic points are counted by A061694.A091266
Number of orbits of length n under the map whose periodic points are counted by A061694.
- Lengths of runs of 3's in A039702.A091267
Lengths of runs of 3's in A039702.
- Number of orbits of length n under the map whose periodic points are counted by A061685.A091268
Number of orbits of length n under the map whose periodic points are counted by A061685.
- a(n) = length of longest prefix of binary representation of n that is also a suffix of that of n+1.A091269
a(n) = length of longest prefix of binary representation of n that is also a suffix of that of n+1.
- Smallest number having in binary representation a prefix of length n that is also a suffix of its successor.A091270
Smallest number having in binary representation a prefix of length n that is also a suffix of its successor.
- Numbers k such that 4*k^2-11 is a prime.A091271
Numbers k such that 4*k^2-11 is a prime.
- Primes of the form n^2 - 11.A091272
Primes of the form n^2 - 11.
- Indices of primes of the form k^2 - 11.A091273
Indices of primes of the form k^2 - 11.
- A090940 indexed by A000040.A091274
A090940 indexed by A000040.
- A090941 indexed by A000040.A091275
A090941 indexed by A000040.
- A090939(n)/n.A091276
A090939(n)/n.
- Numbers k such that the k-th prime is of the form m^2 + (m+1)^2.A091277
Numbers k such that the k-th prime is of the form m^2 + (m+1)^2.
- Squares arising in A089632.A091278
Squares arising in A089632.
- Square roots of A091278.A091279
Square roots of A091278.
- A091432 indexed by A000040.A091280
A091432 indexed by A000040.
- Central term in powers of the Lo-Shu Magic Square as a matrix.A091281
Central term in powers of the Lo-Shu Magic Square as a matrix.
- Exponent of 2 in prime(n)^2 - 1.A091282
Exponent of 2 in prime(n)^2 - 1.
- Exponent of 2 in -1+prime[n]^s, if s is an exponent of the form s=8k-4.A091283
Exponent of 2 in -1+prime[n]^s, if s is an exponent of the form s=8k-4.
- Exponent of 2 in -1+prime[n]^s, if s is an exponent of form 16k-8. Except a(1)=0, a(n)=1+A091283(n).A091284
Exponent of 2 in -1+prime[n]^s, if s is an exponent of form 16k-8. Except a(1)=0, a(n)=1+A091283(n).
- Numbers k such that sigma_3(k) is divisible by the square of phi(k).A091285
Numbers k such that sigma_3(k) is divisible by the square of phi(k).
- Numbers n such that sigma_3(n) is divisible by square of cototient of n, while n is not a prime number.A091286
Numbers n such that sigma_3(n) is divisible by square of cototient of n, while n is not a prime number.
- Numbers k such that (sigma(k)+sigma(k+1))/sigma(2*k+1) is an integer, where sigma = A000203.A091287
Numbers k such that (sigma(k)+sigma(k+1))/sigma(2*k+1) is an integer, where sigma = A000203.
- Duplicate of A067171.A091288
Duplicate of A067171.
- Integer solutions x to sigma(x) + sigma(x+1) = 2*sigma(2x+1) where sigma = A000203.A091289
Integer solutions x to sigma(x) + sigma(x+1) = 2*sigma(2x+1) where sigma = A000203.
- Numbers k such that sigma(k) + sigma(k+1) <= sigma(2*k+1).A091290
Numbers k such that sigma(k) + sigma(k+1) <= sigma(2*k+1).
- Numbers k such that the quotient (sigma(k) + sigma(k+1))/sigma(2*k+1) is smaller than 1/2.A091291
Numbers k such that the quotient (sigma(k) + sigma(k+1))/sigma(2*k+1) is smaller than 1/2.
- Numbers k such that the quotient (sigma(k) + sigma(k+1) + sigma(k+2))/sigma(3*k+3) is an integer.A091292
Numbers k such that the quotient (sigma(k) + sigma(k+1) + sigma(k+2))/sigma(3*k+3) is an integer.
- a(n) is the smallest x for which the following quotient is an integer: (sigma(x) + ... + sigma(x+n-1))/sigma(x+(x+1)+ ... + (x+n-1)), i.e., sum(sigma(j))/sigma(sum(j)) for n terms summed up was integer.A091293
a(n) is the smallest x for which the following quotient is an integer: (sigma(x) + ... + sigma(x+n-1))/sigma(x+(x+1)+ ... + (x+n-1)), i.e., sum(sigma(j))/sigma(sum(j)) for n terms summed up was integer.
- Numbers n such that phi(n) = phi(3n+1).A091294
Numbers n such that phi(n) = phi(3n+1).
- (Number of primes == 3 mod 4 less than 10^n) - (number of primes == 1 mod 4 less than 10^n).A091295
(Number of primes == 3 mod 4 less than 10^n) - (number of primes == 1 mod 4 less than 10^n).
- Semiprimes with odd digits.A091296
Semiprimes with odd digits.
- A fixed point of the morphism 0 -> 02, 1 -> 02, 2 -> 11, starting from 0.A091297
A fixed point of the morphism 0 -> 02, 1 -> 02, 2 -> 11, starting from 0.
- Triangle read by rows: T(n,k) is the number of plane partitions of n containing exactly k parts.A091298
Triangle read by rows: T(n,k) is the number of plane partitions of n containing exactly k parts.
- Number of (directed) Hamiltonian paths (or Gray codes) on the n-cube.A091299
Number of (directed) Hamiltonian paths (or Gray codes) on the n-cube.
- Nonprimes of the form 6k + 1.A091300
Nonprimes of the form 6k + 1.
- Primes of the form p*q + p - q, where p and q are distinct primes.A091301
Primes of the form p*q + p - q, where p and q are distinct primes.
- Number of equivalence classes of directed Hamiltonian cycles (or Gray codes) in the binary n-cube with one node marked.A091302
Number of equivalence classes of directed Hamiltonian cycles (or Gray codes) in the binary n-cube with one node marked.
- Third diagonal of A008970 (after A000111 and A000708).A091303
Third diagonal of A008970 (after A000111 and A000708).
- a(n) = Omega(2n-1) (number of prime factors of the n-th odd number, counted with multiplicity).A091304
a(n) = Omega(2n-1) (number of prime factors of the n-th odd number, counted with multiplicity).
- Primes of the form p*q - p - q, where p and q are primes.A091305
Primes of the form p*q - p - q, where p and q are primes.
- Sum of squares of unitary, squarefree divisors of n, including 1.A091306
Sum of squares of unitary, squarefree divisors of n, including 1.
- a(n) = 6*2^n + 4 (Bode Number A003461(n+2)) except for a(1)=6.A091307
a(n) = 6*2^n + 4 (Bode Number A003461(n+2)) except for a(1)=6.
- Primes in A038395 (concatenate first n odd numbers in reverse order).A091308
Primes in A038395 (concatenate first n odd numbers in reverse order).
- Partial sums of A091316.A091309
Partial sums of A091316.
- Primes not of the form p*q + p - q with prime p and q.A091310
Primes not of the form p*q + p - q with prime p and q.