Sequences
392,541 sequences
- Lengths of the B blocks in analysis of A090822.A091411
Lengths of the B blocks in analysis of A090822.
- Lengths of runs in A090822.A091412
Lengths of runs in A090822.
- Partial sums of A090822.A091413
Partial sums of A090822.
- Least number that is the sum of n positive n-th powers in at least 2 ways.A091414
Least number that is the sum of n positive n-th powers in at least 2 ways.
- Numbers k such that k!*2^k - 1 is prime.A091415
Numbers k such that k!*2^k - 1 is prime.
- Natural numbers written out and then regrouped into the smallest possible nontrivial blocks such that each begins and ends with the same digit. (Leading zeros omitted and not counted as beginning digit).A091416
Natural numbers written out and then regrouped into the smallest possible nontrivial blocks such that each begins and ends with the same digit. (Leading zeros omitted and not counted as beginning digit).
- Integers n which are not the difference of 2 integers A and B where A is less than or equal to n such that AB+1 and AB-1 are both primes. In other words, the product A*B cannot be the middle integer of a twin prime pair.A091417
Integers n which are not the difference of 2 integers A and B where A is less than or equal to n such that AB+1 and AB-1 are both primes. In other words, the product A*B cannot be the middle integer of a twin prime pair.
- Integers n which are not the sum or difference of 2 integers A and B where A is less than or equal to n such that AB+1 and AB-1are both primes. In other words, the product A*B cannot be the middle integer of a twin prime pair.A091418
Integers n which are not the sum or difference of 2 integers A and B where A is less than or equal to n such that AB+1 and AB-1are both primes. In other words, the product A*B cannot be the middle integer of a twin prime pair.
- Squares arising in A089653.A091419
Squares arising in A089653.
- Square roots of A091419.A091420
Square roots of A091419.
- Numbers m such that m#*2^m - 1 is prime, where m# = A002110(m).A091421
Numbers m such that m#*2^m - 1 is prime, where m# = A002110(m).
- Write the natural numbers in binary, break the result up into blocks of 2 digits each and convert each block back into decimal.A091422
Write the natural numbers in binary, break the result up into blocks of 2 digits each and convert each block back into decimal.
- G.f.: ((1 + x^9)*(1 + x^(15)) ) / ( (1 - x^3)*(1 - x^5)*(1 - x^8)*(1 - x^(12))).A091423
G.f.: ((1 + x^9)*(1 + x^(15)) ) / ( (1 - x^3)*(1 - x^5)*(1 - x^8)*(1 - x^(12))).
- Numbers m such that m#*2^m + 1 is prime, where m# = A002110(m).A091424
Numbers m such that m#*2^m + 1 is prime, where m# = A002110(m).
- Write the natural numbers in a triangle with k digits in the k-th row, as shown below. Sequence gives the leading diagonal.A091425
Write the natural numbers in a triangle with k digits in the k-th row, as shown below. Sequence gives the leading diagonal.
- Expansion of (1 + x^18 + x^21 + x^22 + x^23 + x^24 + x^27 + x^45) / ( (1 - x^8)*(1 - x^12)*(1 - x^14)*(1 - x^15)).A091426
Expansion of (1 + x^18 + x^21 + x^22 + x^23 + x^24 + x^27 + x^45) / ( (1 - x^8)*(1 - x^12)*(1 - x^14)*(1 - x^15)).
- Write out the primes and then regroup in 3 digit blocks (omitting leading zeros).A091427
Write out the primes and then regroup in 3 digit blocks (omitting leading zeros).
- Numbers k such that abs(A092673(k)) = 1.A091428
Numbers k such that abs(A092673(k)) = 1.
- Numerator of a(n) = (integral_{x=0..1/3} (1-x^2)^n dx).A091429
Numerator of a(n) = (integral_{x=0..1/3} (1-x^2)^n dx).
- Number of Hamiltonian symmetric trivalent (or cubic) connected graphs on 2n nodes (the Foster census).A091430
Number of Hamiltonian symmetric trivalent (or cubic) connected graphs on 2n nodes (the Foster census).
- Happy-go-Lucky numbers: numbers that are both Happy (A007770) and Lucky (A000959).A091431
Happy-go-Lucky numbers: numbers that are both Happy (A007770) and Lucky (A000959).
- Happy-go-Lucky primes: primes arising in A091431.A091432
Happy-go-Lucky primes: primes arising in A091431.
- a(n)=2*3^n - 18*4^n + 24*5^n.A091433
a(n)=2*3^n - 18*4^n + 24*5^n.
- Poincaré series [or Poincare series] (or Molien series) for a certain four-fold wreath product P_4.A091434
Poincaré series [or Poincare series] (or Molien series) for a certain four-fold wreath product P_4.
- Array T(n,k) = n*(n+k), read by antidiagonals.A091435
Array T(n,k) = n*(n+k), read by antidiagonals.
- Nonnegative integers whose name in Hebrew begins with the Hebrew letter "aleph".A091436
Nonnegative integers whose name in Hebrew begins with the Hebrew letter "aleph".
- Number of bipartite partitions of ceiling(n/2) white objects and floor(n/2) black ones.A091437
Number of bipartite partitions of ceiling(n/2) white objects and floor(n/2) black ones.
- Triangle a(n,k) of partitions of n objects of 2 colors, k of which are black and each part with at least one black object.A091438
Triangle a(n,k) of partitions of n objects of 2 colors, k of which are black and each part with at least one black object.
- Least k such that k/phi(k) >= n, where phi is Euler's totient function.A091439
Least k such that k/phi(k) >= n, where phi is Euler's totient function.
- Smallest number m such that m#/phi(m#) >= n, where m# indicates the primorial (A034386) of m and phi is Euler's totient function.A091440
Smallest number m such that m#/phi(m#) >= n, where m# indicates the primorial (A034386) of m and phi is Euler's totient function.
- Table (by antidiagonals) of permutations of two types of objects such that each cycle contains at least one object of each type. Each type of object is labeled from its own label set.A091441
Table (by antidiagonals) of permutations of two types of objects such that each cycle contains at least one object of each type. Each type of object is labeled from its own label set.
- Table (by antidiagonals) of permutations of two types of objects such that each cycle contains at least one object of each type. Each type of object is unlabeled.A091442
Table (by antidiagonals) of permutations of two types of objects such that each cycle contains at least one object of each type. Each type of object is unlabeled.
- Multiperfect numbers n which are divisible by sopfr(n) (multiperfect number: sigma(n) = k*n with k integer, sopfr: Sum of prime factors with repetition).A091443
Multiperfect numbers n which are divisible by sopfr(n) (multiperfect number: sigma(n) = k*n with k integer, sopfr: Sum of prime factors with repetition).
- Concatenate binary vectors ordered first by length, then by the number of 1's and finally lexicographically.A091444
Concatenate binary vectors ordered first by length, then by the number of 1's and finally lexicographically.
- Concatenate binary vectors ordered first by length, then by the number of 1's and finally by a 'reverse' lexicographical ordering (read words from right to left).A091445
Concatenate binary vectors ordered first by length, then by the number of 1's and finally by a 'reverse' lexicographical ordering (read words from right to left).
- Concatenate binary vectors ordered first by length, then by the number of 1's and finally by an 'unusual' lexicographical ordering (1 comes before 0).A091446
Concatenate binary vectors ordered first by length, then by the number of 1's and finally by an 'unusual' lexicographical ordering (1 comes before 0).
- Concatenate binary vectors ordered first by length, then by the number of 1's and finally by an 'unusual' lexicographical ordering (read words from right to left, 1 comes before 0).A091447
Concatenate binary vectors ordered first by length, then by the number of 1's and finally by an 'unusual' lexicographical ordering (read words from right to left, 1 comes before 0).
- Numbers k such that a1 > a2, where [a0,a1,a2,...] is the simple continued fraction of sqrt(k).A091448
Numbers k such that a1 > a2, where [a0,a1,a2,...] is the simple continued fraction of sqrt(k).
- Array T(n,k) read by antidiagonals, where row n is the increasing sequence of numbers m for which the simple continued fraction of sqrt(m) has period n, n >= 0, k >= 1.A091449
Array T(n,k) read by antidiagonals, where row n is the increasing sequence of numbers m for which the simple continued fraction of sqrt(m) has period n, n >= 0, k >= 1.
- Transpose of A091449: array T(n,k) read by antidiagonals, where column k is the increasing sequence of numbers m for which the simple continued fraction of sqrt(m) has period k, n >= 1, k >= 0.A091450
Transpose of A091449: array T(n,k) read by antidiagonals, where column k is the increasing sequence of numbers m for which the simple continued fraction of sqrt(m) has period k, n >= 1, k >= 0.
- Array T(n,k) read by antidiagonals: (row 0)=squares, (row 1)={numbers m for which the simple continued fraction (CF) of sqrt(m) has period length 1}; once (row n) is defined, let (row n+1) begin with the least positive integer not already in a row and let the rest of (row n+1) be the other m's for which CF(sqrt(m)) has the same period length.A091451
Array T(n,k) read by antidiagonals: (row 0)=squares, (row 1)={numbers m for which the simple continued fraction (CF) of sqrt(m) has period length 1}; once (row n) is defined, let (row n+1) begin with the least positive integer not already in a row and let the rest of (row n+1) be the other m's for which CF(sqrt(m)) has the same period length.
- Transpose of array in A091451 associated with period lengths of square roots of positive integers.A091452
Transpose of array in A091451 associated with period lengths of square roots of positive integers.
- Triangular array T(n,k) read by rows in which row n consists of the numbers floor(2n/k), k=1,2,...,2n+1.A091453
Triangular array T(n,k) read by rows in which row n consists of the numbers floor(2n/k), k=1,2,...,2n+1.
- Integers k such that 3*phi(k) < k.A091454
Integers k such that 3*phi(k) < k.
- Integers n such that 3*phi(n) < n that are not multiples of smaller integers with this property.A091455
Integers n such that 3*phi(n) < n that are not multiples of smaller integers with this property.
- Least number k such that n * phi(k) < k, where phi is Euler's totient function.A091456
Least number k such that n * phi(k) < k, where phi is Euler's totient function.
- Greatest numerator of the remainder in a reciprocal expansion of 1.A091457
Greatest numerator of the remainder in a reciprocal expansion of 1.
- Denominators corresponding to A091457.A091458
Denominators corresponding to A091457.
- Numbers n such that n-1, n and n+1 can be expressed as a sum of 2 squares in at least 2 ways.A091459
Numbers n such that n-1, n and n+1 can be expressed as a sum of 2 squares in at least 2 ways.
- Greatest size of an arithmetic progression contained as substrings in binary representation of n.A091460
Greatest size of an arithmetic progression contained as substrings in binary representation of n.