Sequences
392,541 sequences
- Numbers n such that A001840(n) == 0 (mod n).A091361
Numbers n such that A001840(n) == 0 (mod n).
- Primes p such that the sum of the digits of p is not prime, but the sum of the squares of the digits of p is prime.A091362
Primes p such that the sum of the digits of p is not prime, but the sum of the squares of the digits of p is prime.
- a(n) = n!*n^3.A091363
a(n) = n!*n^3.
- a(n) = n! * n^4.A091364
a(n) = n! * n^4.
- Primes p such that the sum of the digits of p is not prime, but the sum of the cubes of the digits of p is prime.A091365
Primes p such that the sum of the digits of p is not prime, but the sum of the cubes of the digits of p is prime.
- Primes p such that the sum of the cubes of the digits of p is prime.A091366
Primes p such that the sum of the cubes of the digits of p is prime.
- Primes p such that the sum of the digits raised to the 4th power is prime.A091367
Primes p such that the sum of the digits raised to the 4th power is prime.
- Primes p such that the sum of the digits of p is not prime, but the sum of each digit raised to the 4th power is prime.A091368
Primes p such that the sum of the digits of p is not prime, but the sum of each digit raised to the 4th power is prime.
- a(n) = Sum_{i=1..n} phi(i)*ceiling(n/i).A091369
a(n) = Sum_{i=1..n} phi(i)*ceiling(n/i).
- Triangle read by rows: T(n,k) is the number of dissections of a convex n-gon by nonintersecting diagonals, having a k-gon over a fixed edge (base).A091370
Triangle read by rows: T(n,k) is the number of dissections of a convex n-gon by nonintersecting diagonals, having a k-gon over a fixed edge (base).
- Smallest prime factor of n - number of prime factors of n with multiplicity.A091371
Smallest prime factor of n - number of prime factors of n with multiplicity.
- Number of numbers <= n having more prime factors than the value of their smallest prime factor.A091372
Number of numbers <= n having more prime factors than the value of their smallest prime factor.
- Number of numbers <= n having exactly as many prime factors as the value of their smallest prime factor.A091373
Number of numbers <= n having exactly as many prime factors as the value of their smallest prime factor.
- Number of numbers <= n having fewer prime factors than the value of their smallest prime factor.A091374
Number of numbers <= n having fewer prime factors than the value of their smallest prime factor.
- Numbers k with property that the number of prime factors of k (counted with repetition) exceeds the smallest prime factor of k.A091375
Numbers k with property that the number of prime factors of k (counted with repetition) exceeds the smallest prime factor of k.
- Numbers k with property that the number of prime factors of k (counted with repetition) equals the smallest prime factor of k.A091376
Numbers k with property that the number of prime factors of k (counted with repetition) equals the smallest prime factor of k.
- Numbers having fewer prime factors than the value of their smallest prime factor.A091377
Numbers having fewer prime factors than the value of their smallest prime factor.
- Triangle read by rows: T(m,n) = number of weak factorization systems (trivial Quillen model structures) on the poset of order-preserving maps from [m] to [n+1] (where [m] denotes the total order on m objects), viewed as a category.A091378
Triangle read by rows: T(m,n) = number of weak factorization systems (trivial Quillen model structures) on the poset of order-preserving maps from [m] to [n+1] (where [m] denotes the total order on m objects), viewed as a category.
- a(n) = Product_{ p | n } (1 + Legendre(-1,p) ).A091379
a(n) = Product_{ p | n } (1 + Legendre(-1,p) ).
- Largest quadratic "mixed" residue modulo the n-th prime (LQxR(p_n)).A091380
Largest quadratic "mixed" residue modulo the n-th prime (LQxR(p_n)).
- First differences of A091380.A091381
First differences of A091380.
- Distance between the sequence of primes and the largest "mixed" quadratic residues modulo the primes (A091380).A091382
Distance between the sequence of primes and the largest "mixed" quadratic residues modulo the primes (A091380).
- Prime numbers where the sequence of largest quadratic "mixed" residues modulo the primes (A091380) is non-monotonic.A091383
Prime numbers where the sequence of largest quadratic "mixed" residues modulo the primes (A091380) is non-monotonic.
- Members of the difference sequence (A091381) of the sequence of largest quadratic "mixed" residues modulo the primes (A091380) where the latter is non-monotonic.A091384
Members of the difference sequence (A091381) of the sequence of largest quadratic "mixed" residues modulo the primes (A091380) where the latter is non-monotonic.
- Distance (A091382) of primes from the largest quadratic "mixed" residues modulo the primes (A091380), where the latter is non-monotonic.A091385
Distance (A091382) of primes from the largest quadratic "mixed" residues modulo the primes (A091380), where the latter is non-monotonic.
- Solution to the merit factor problem.A091386
Solution to the merit factor problem.
- Aronson's mod 13 sequence: "T is the first, fourth, eleventh, third, ... letter in this sentence, not counting spaces or commas and all mod 13".A091387
Aronson's mod 13 sequence: "T is the first, fourth, eleventh, third, ... letter in this sentence, not counting spaces or commas and all mod 13".
- Aronson's mod 14 sequence: "T is the first, fourth, eleventh, third,... letter in this sentence, not counting spaces and commas and all mod 14".A091388
Aronson's mod 14 sequence: "T is the first, fourth, eleventh, third,... letter in this sentence, not counting spaces and commas and all mod 14".
- Aronson's mod 15 sequence: "T is the first, fourth, eleventh, first, ... letter in this sentence, not counting spaces and commas and all mod 15".A091389
Aronson's mod 15 sequence: "T is the first, fourth, eleventh, first, ... letter in this sentence, not counting spaces and commas and all mod 15".
- Aronson's mod 16 sequence: "T is the first, fourth, eleventh, zeroth, ... letter in this sentence, not counting spaces or commas and all mod 16".A091390
Aronson's mod 16 sequence: "T is the first, fourth, eleventh, zeroth, ... letter in this sentence, not counting spaces or commas and all mod 16".
- Aronson's mod 17 sequence: "T is the first, fourth, eleventh, sixteenth, seventh, ... letter in this sentence, not counting spaces and commas and all mod 17".A091391
Aronson's mod 17 sequence: "T is the first, fourth, eleventh, sixteenth, seventh, ... letter in this sentence, not counting spaces and commas and all mod 17".
- Product_{ p | n } (1 + Legendre(-2,p) ).A091392
Product_{ p | n } (1 + Legendre(-2,p) ).
- a(n) = Product_{ p | n } (1 + Legendre(-3,p) ).A091393
a(n) = Product_{ p | n } (1 + Legendre(-3,p) ).
- a(n) = Product_{ p | n } (1 + Legendre(-5,p) ).A091394
a(n) = Product_{ p | n } (1 + Legendre(-5,p) ).
- a(n) = Product_{ p | n } (1 + Legendre(-7,p) ).A091395
a(n) = Product_{ p | n } (1 + Legendre(-7,p) ).
- a(n) = Product_{ p | n } (1 + Legendre(2,p) ).A091396
a(n) = Product_{ p | n } (1 + Legendre(2,p) ).
- a(n) = Product_{ p | n } (1 + Legendre(3,p) ).A091397
a(n) = Product_{ p | n } (1 + Legendre(3,p) ).
- a(n) = Product_{ p | n } (1 + Legendre(5,p) ).A091398
a(n) = Product_{ p | n } (1 + Legendre(5,p) ).
- a(n) = Product_{ p | n } (1 + Legendre(7,p) ).A091399
a(n) = Product_{ p | n } (1 + Legendre(7,p) ).
- a(n) = Product_{ odd primes p | n } (1 + Legendre(-1,p) ).A091400
a(n) = Product_{ odd primes p | n } (1 + Legendre(-1,p) ).
- Numbers n such that genus of group Gamma_0(n) is zero.A091401
Numbers n such that genus of group Gamma_0(n) is zero.
- Erroneous version of A091401.A091402
Erroneous version of A091401.
- Numbers n such that genus of group Gamma_0(n) is 1.A091403
Numbers n such that genus of group Gamma_0(n) is 1.
- Numbers n such that genus of group Gamma_0(n) is 2.A091404
Numbers n such that genus of group Gamma_0(n) is 2.
- Smaller of two consecutive numbers with the same prime signature not occurring earlier.A091405
Smaller of two consecutive numbers with the same prime signature not occurring earlier.
- Reversion of series for j-function.A091406
Reversion of series for j-function.
- Values of len_y(n) for A090822.A091407
Values of len_y(n) for A090822.
- Values of len_x(n) for A090822.A091408
Values of len_x(n) for A090822.
- a(n) is the smallest m such that A090822(m) = n.A091409
a(n) is the smallest m such that A090822(m) = n.
- Values of n such that len_x(n) = 0 in A090822.A091410
Values of n such that len_x(n) = 0 in A090822.