Sequences
392,541 sequences
- Subsequence of sequence A083359 in which every prime factor can be found in the number at least as often as it is factor of the number.A083361
Subsequence of sequence A083359 in which every prime factor can be found in the number at least as often as it is factor of the number.
- Square table, read by antidiagonals, of least distinct positive integers such that the sum of any two consecutive terms in any row is a square number.A083362
Square table, read by antidiagonals, of least distinct positive integers such that the sum of any two consecutive terms in any row is a square number.
- Diagonal of table A083362.A083363
Diagonal of table A083362.
- Antidiagonal sums of table A083362.A083364
Antidiagonal sums of table A083362.
- Expansion of psi(x) / phi(x) in powers of x where phi(), psi() are Ramanujan theta functions.A083365
Expansion of psi(x) / phi(x) in powers of x where phi(), psi() are Ramanujan theta functions.
- Numbers k such that 7*11^k + 2 is prime.A083366
Numbers k such that 7*11^k + 2 is prime.
- Numbers k that are equal to the sum of its divisors after the digits of each divisor have been sorted in ascending order.A083367
Numbers k that are equal to the sum of its divisors after the digits of each divisor have been sorted in ascending order.
- a(n) is the position of the highest one in A003754(n).A083368
a(n) is the position of the highest one in A003754(n).
- Essentially a duplicate of A000946.A083369
Essentially a duplicate of A000946.
- Primes satisfying f(2p)=p when f(1)=5 (see comment).A083370
Primes satisfying f(2p)=p when f(1)=5 (see comment).
- Primes p such that q-p >= 8, where q is the next prime after p.A083371
Primes p such that q-p >= 8, where q is the next prime after p.
- Least number having exactly two odd prime factors that differ by 2n.A083372
Least number having exactly two odd prime factors that differ by 2n.
- 2n is equal to the sum of its divisors after the digits have been sorted in descending order (zeros dropped).A083373
2n is equal to the sum of its divisors after the digits have been sorted in descending order (zeros dropped).
- a(n) = n^2 * (n^2 - 1)/2.A083374
a(n) = n^2 * (n^2 - 1)/2.
- n appears prime(n) times.A083375
n appears prime(n) times.
- Numbers k such that A053664(k) is prime.A083376
Numbers k such that A053664(k) is prime.
- a(n) = the largest integer whose square has n digits and first digit 1.A083377
a(n) = the largest integer whose square has n digits and first digit 1.
- a(n) is the largest integer whose cube has n digits and first digit 1, except that a(2)=2.A083378
a(n) is the largest integer whose cube has n digits and first digit 1, except that a(2)=2.
- a(n) = the number of squares with at most n digits and first digit 1.A083379
a(n) = the number of squares with at most n digits and first digit 1.
- a(n) is the number of cubes with at most n digits and first digit 1.A083380
a(n) is the number of cubes with at most n digits and first digit 1.
- Square array giving the number of trellis edges T(i,j) (i >= 0, j >= 0), read by antidiagonals.A083381
Square array giving the number of trellis edges T(i,j) (i >= 0, j >= 0), read by antidiagonals.
- Write the numbers from 1 to n^2 consecutively in n rows of length n; a(n) = minimal number of primes in a row.A083382
Write the numbers from 1 to n^2 consecutively in n rows of length n; a(n) = minimal number of primes in a row.
- Positions of records in A083382.A083383
Positions of records in A083382.
- a(n) = n*Sum(((k-1)/2)*k!*Stirling_2(n,k),k=1..n).A083384
a(n) = n*Sum(((k-1)/2)*k!*Stirling_2(n,k),k=1..n).
- Total height of all elements in all preferential arrangements of n elements, where elements at the bottom level have height 1.A083385
Total height of all elements in all preferential arrangements of n elements, where elements at the bottom level have height 1.
- Number (undirected) Hamiltonian paths in the 5 X n knight graph.A083386
Number (undirected) Hamiltonian paths in the 5 X n knight graph.
- Numbers n such that the number formed by the digits of 2n sorted in ascending order is equal to the sum of the divisors of n after the digits of each divisor have been sorted in ascending order.A083387
Numbers n such that the number formed by the digits of 2n sorted in ascending order is equal to the sum of the divisors of n after the digits of each divisor have been sorted in ascending order.
- a(n) = beginning of a run of at least n primes when x -> 3*x + 2 is iterated.A083388
a(n) = beginning of a run of at least n primes when x -> 3*x + 2 is iterated.
- Numbers n such that the number formed by the digits of 2n sorted in descending order is equal to the sum of the divisors of n after the digits of each divisor have been sorted in descending order (all zeros dropped).A083389
Numbers n such that the number formed by the digits of 2n sorted in descending order is equal to the sum of the divisors of n after the digits of each divisor have been sorted in descending order (all zeros dropped).
- Integers m such that 2m + 1 divides lcm(1,3,5,...,2m - 1).A083390
Integers m such that 2m + 1 divides lcm(1,3,5,...,2m - 1).
- n-th Payam number E_{-}(n), defined as the smallest positive odd integer k such that for every positive integer m, the number k*2^m-1 is not divisible by any primes p such that the multiplicative order of 2 mod p is less than or equal to n.A083391
n-th Payam number E_{-}(n), defined as the smallest positive odd integer k such that for every positive integer m, the number k*2^m-1 is not divisible by any primes p such that the multiplicative order of 2 mod p is less than or equal to n.
- Alternating partial sums of A000217.A083392
Alternating partial sums of A000217.
- Palindromes such that the sum of the digits is prime.A083393
Palindromes such that the sum of the digits is prime.
- Terms of A083393 such that the sum of the factorials of the digits is prime.A083394
Terms of A083393 such that the sum of the factorials of the digits is prime.
- Multiply the digits in pairs, stop when reach a number with an odd number of digits.A083395
Multiply the digits in pairs, stop when reach a number with an odd number of digits.
- Least n such that n and 2k+n are both brilliant numbers.A083396
Least n such that n and 2k+n are both brilliant numbers.
- Largest prime factor of n! + k where k is the least positive integer such that n! + k is a square.A083397
Largest prime factor of n! + k where k is the least positive integer such that n! + k is a square.
- Number of diagonals needed to produce a list {1,..n} in the Wythoff array.A083398
Number of diagonals needed to produce a list {1,..n} in the Wythoff array.
- Number of divisors of n that are not divisors of other divisors of n.A083399
Number of divisors of n that are not divisors of other divisors of n.
- Numbers n such that A053664(n) and A073605(n) are primes.A083400
Numbers n such that A053664(n) and A073605(n) are primes.
- Numbers k such that A073605(k) is prime.A083401
Numbers k such that A073605(k) is prime.
- Let A_n be the upper triangular matrix in the group GL(n,2) that has zero entries below the main diagonal and 1 elsewhere; a(n) is the size of the conjugacy class of this matrix in GL(n,2).A083402
Let A_n be the upper triangular matrix in the group GL(n,2) that has zero entries below the main diagonal and 1 elsewhere; a(n) is the size of the conjugacy class of this matrix in GL(n,2).
- Write the numbers 1, 2, ... in a triangle with n terms in the n-th row; a(n) = number of squarefree integers in n-th row.A083403
Write the numbers 1, 2, ... in a triangle with n terms in the n-th row; a(n) = number of squarefree integers in n-th row.
- Illustration of Viswanath's constant A078416.A083404
Illustration of Viswanath's constant A078416.
- Odd numbers which can be expressed as the product of a number and its reversal in at least two different ways.A083405
Odd numbers which can be expressed as the product of a number and its reversal in at least two different ways.
- Even squares which can be expressed as the product of a number and its reversal in at least two different ways.A083406
Even squares which can be expressed as the product of a number and its reversal in at least two different ways.
- Odd squares which can be expressed as the product of a number and its reversal in at least two different ways.A083407
Odd squares which can be expressed as the product of a number and its reversal in at least two different ways.
- Squares which can be expressed as the product of a number and its reversal in at least two different ways.A083408
Squares which can be expressed as the product of a number and its reversal in at least two different ways.
- Number of prime k-tuplet constellations; i.e., patterns with minimal diameter A008407.A083409
Number of prime k-tuplet constellations; i.e., patterns with minimal diameter A008407.
- a(n) = A083385(n)/n.A083410
a(n) = A083385(n)/n.