Sequences
392,541 sequences
- Array A(x,y): concatenation of the binary expansions of x & y in such a way that 'y' is inserted after the least significant 1-bit of 'x', followed by the remaining 0-bits, if any. Listed antidiagonalwise as A(0,0), A(1,0), A(0,1), A(2,0), A(1,1), A(0,2), ... Zero is expanded as an empty string.A085211
Array A(x,y): concatenation of the binary expansions of x & y in such a way that 'y' is inserted after the least significant 1-bit of 'x', followed by the remaining 0-bits, if any. Listed antidiagonalwise as A(0,0), A(1,0), A(0,1), A(2,0), A(1,1), A(0,2), ... Zero is expanded as an empty string.
- Transpose of A085211.A085212
Transpose of A085211.
- Array A085211 in binary.A085213
Array A085211 in binary.
- Array A085212 in binary.A085214
Array A085212 in binary.
- Square array A(x,y) = the number whose factorial expansion A007623 is that of x and y concatenated; zero expanded as empty string; read by ascending antidiagonals: A(0,0), A(1,0), A(0,1), A(2,0), A(1,1), A(0,2), ...A085215
Square array A(x,y) = the number whose factorial expansion A007623 is that of x and y concatenated; zero expanded as empty string; read by ascending antidiagonals: A(0,0), A(1,0), A(0,1), A(2,0), A(1,1), A(0,2), ...
- Transpose of A085215.A085216
Transpose of A085215.
- Factorial expansions of the entries in A085215.A085217
Factorial expansions of the entries in A085215.
- Factorial expansions of the entries in A085216.A085218
Factorial expansions of the entries in A085216.
- Array A(x,y): "rised concatenation" of factorial expansions of x & y, listed antidiagonalwise as A(0,0), A(1,0), A(0,1), A(2,0), A(1,1), A(0,2), ... Zero is expanded as an empty string.A085219
Array A(x,y): "rised concatenation" of factorial expansions of x & y, listed antidiagonalwise as A(0,0), A(1,0), A(0,1), A(2,0), A(1,1), A(0,2), ... Zero is expanded as an empty string.
- Transpose of A085219.A085220
Transpose of A085219.
- Factorial expansions of the entries in A085219.A085221
Factorial expansions of the entries in A085219.
- Factorial expansions of the entries in A085220.A085222
Factorial expansions of the entries in A085220.
- Row 1 of A085201.A085223
Row 1 of A085201.
- A014486-encodings of the plane general trees whose rightmost subtree (branching from the root) is just a stick: /.A085224
A014486-encodings of the plane general trees whose rightmost subtree (branching from the root) is just a stick: /.
- Row 1 of A085203.A085225
Row 1 of A085203.
- Row 0 of A085205.A085226
Row 0 of A085205.
- Column 0 of A085205.A085227
Column 0 of A085205.
- Diagonal of array A085205.A085228
Diagonal of array A085205.
- Smallest number which is coprime to n and to a(n-1), and is not yet in the sequence; a(1)=1.A085229
Smallest number which is coprime to n and to a(n-1), and is not yet in the sequence; a(1)=1.
- Inverse of A085229.A085230
Inverse of A085229.
- Numbers k in whose canonical factorization the power of the smallest prime factor is greater than the power of the greatest prime factor.A085231
Numbers k in whose canonical factorization the power of the smallest prime factor is greater than the power of the greatest prime factor.
- In canonical prime factorization: power of smallest prime factor is less than power of greatest prime factor.A085232
In canonical prime factorization: power of smallest prime factor is less than power of greatest prime factor.
- Numbers k such that k is divisible by a power of its smallest prime factor that exceeds its square root.A085233
Numbers k such that k is divisible by a power of its smallest prime factor that exceeds its square root.
- (Greatest power of smallest prime factor of n) < square root(n).A085234
(Greatest power of smallest prime factor of n) < square root(n).
- (Greatest power of greatest prime factor of n) > square root(n).A085235
(Greatest power of greatest prime factor of n) > square root(n).
- (Greatest power of greatest prime factor of n) < square root(n).A085236
(Greatest power of greatest prime factor of n) < square root(n).
- Nondecreasing gaps between primes.A085237
Nondecreasing gaps between primes.
- Sort the numbers 2^i and 3^j. Then a(n) is the exponent of the n-th term.A085238
Sort the numbers 2^i and 3^j. Then a(n) is the exponent of the n-th term.
- Sort the numbers 2^i and 3^j. Then a(n) is the base of the n-th term. Set a(1)=1.A085239
Sort the numbers 2^i and 3^j. Then a(n) is the base of the n-th term. Set a(1)=1.
- As exponents > 0 in powers of 2 or 3 (A006899) occur in A085238 exactly twice, a self-inverse permutation of natural numbers is induced.A085240
As exponents > 0 in powers of 2 or 3 (A006899) occur in A085238 exactly twice, a self-inverse permutation of natural numbers is induced.
- a(n) = A085239(n+1) - A085239(n).A085241
a(n) = A085239(n+1) - A085239(n).
- a(n) = A085239(n+1) - 2.A085242
a(n) = A085239(n+1) - 2.
- a(n) = A085238(n+1) - A085238(n).A085243
a(n) = A085238(n+1) - A085238(n).
- Permanent of the symmetric n X n matrix M defined by M(i,j) = gcd(i,j) for 1 <= i,j <= n.A085244
Permanent of the symmetric n X n matrix M defined by M(i,j) = gcd(i,j) for 1 <= i,j <= n.
- Least k such that k*2^n + 1 is a semiprime.A085245
Least k such that k*2^n + 1 is a semiprime.
- Satisfies a(1)=1, a(A026835(n+1)) = a(n)+1, with a(m)=0 for all m not found in A026835, where A026835(n+2)=A026835(n+1)+a(n)+1.A085246
Satisfies a(1)=1, a(A026835(n+1)) = a(n)+1, with a(m)=0 for all m not found in A026835, where A026835(n+2)=A026835(n+1)+a(n)+1.
- Duplicate of A003016.A085247
Duplicate of A003016.
- Left truncatable 3-almost primes, in which repeatedly deleting the leftmost digit gives a 3-almost prime at every step until a single-digit 3-almost prime remains.A085248
Left truncatable 3-almost primes, in which repeatedly deleting the leftmost digit gives a 3-almost prime at every step until a single-digit 3-almost prime remains.
- Terms k of A002977 such that both (k-1)/2 and (k-1)/3 are also terms of A002977.A085249
Terms k of A002977 such that both (k-1)/2 and (k-1)/3 are also terms of A002977.
- 4 times hexagonal numbers: a(n) = 4*n*(2*n-1).A085250
4 times hexagonal numbers: a(n) = 4*n*(2*n-1).
- Numbers that are the sum of the squares of some substring decomposition of themselves.A085251
Numbers that are the sum of the squares of some substring decomposition of themselves.
- Number of ways to write n as sum of two powerful numbers (A001694).A085252
Number of ways to write n as sum of two powerful numbers (A001694).
- Numbers having no representation as sum of two powerful numbers (A001694).A085253
Numbers having no representation as sum of two powerful numbers (A001694).
- Numbers having a unique representation as sum of two powerful numbers (A001694).A085254
Numbers having a unique representation as sum of two powerful numbers (A001694).
- Numbers having at least two representations as a sum of two powerful numbers (A001694).A085255
Numbers having at least two representations as a sum of two powerful numbers (A001694).
- 3-smooth numbers whose arithmetic derivatives are also 3-smooth.A085256
3-smooth numbers whose arithmetic derivatives are also 3-smooth.
- Number of ways to write n as sum of a powerful and a squarefree number.A085257
Number of ways to write n as sum of a powerful and a squarefree number.
- Smallest number with exactly n representations as sum of a powerful and a squarefree number.A085258
Smallest number with exactly n representations as sum of a powerful and a squarefree number.
- Integer part of the conversion from Celsius to Fahrenheit.A085259
Integer part of the conversion from Celsius to Fahrenheit.
- Ratio-determined insertion sequence I(0.0833344) (see the link below).A085260
Ratio-determined insertion sequence I(0.0833344) (see the link below).