Sequences
392,541 sequences
- Palindromic numbers containing one or more odd digits.A092361
Palindromic numbers containing one or more odd digits.
- Number of partitions of n^2 into squares greater than 1.A092362
Number of partitions of n^2 into squares greater than 1.
- n^(1/a(n)) is the closest to an integer on 2..n with a(n) minimal.A092363
n^(1/a(n)) is the closest to an integer on 2..n with a(n) minimal.
- a(n) = n^2*binomial(n,2).A092364
a(n) = n^2*binomial(n,2).
- Coefficient of X^2 in expansion of (1 + n*X + n*X^2)^n.A092365
Coefficient of X^2 in expansion of (1 + n*X + n*X^2)^n.
- Coefficient of x^n in expansion of (1+n*x+n*x^2)^n.A092366
Coefficient of x^n in expansion of (1+n*x+n*x^2)^n.
- Numbers n with property that the binary cyclic right-rotating progressive sum of digits (see A091821) is exactly n/2.A092367
Numbers n with property that the binary cyclic right-rotating progressive sum of digits (see A091821) is exactly n/2.
- a(0)=0, a(1)=1, a(2)=1. For n>2, let R_{k}(n) = the digit reversal of n in base k (R_{k}(n) is written in base 10). a(n) is the smallest value of R_{k}(n) arising if k=2,..,n-1.A092368
a(0)=0, a(1)=1, a(2)=1. For n>2, let R_{k}(n) = the digit reversal of n in base k (R_{k}(n) is written in base 10). a(n) is the smallest value of R_{k}(n) arising if k=2,..,n-1.
- Spiro-tetranacci numbers: a(n) = sum of four previous terms that are nearest when terms arranged in a spiral.A092369
Spiro-tetranacci numbers: a(n) = sum of four previous terms that are nearest when terms arranged in a spiral.
- Triangle read by rows: T(n,k)=(1/2)*C(n+k,k)*C(n,n-k).A092370
Triangle read by rows: T(n,k)=(1/2)*C(n+k,k)*C(n,n-k).
- Triangle read by rows: T(n, k) = binomial(n, k) * binomial(n+k, n-k).A092371
Triangle read by rows: T(n, k) = binomial(n, k) * binomial(n+k, n-k).
- The O(1) loop model on the square lattice is defined as follows: At every vertex the loop turns to the left or to the right with equal probability, unless the vertex has been visited before, in which case the loop leaves the vertex via the unused edge. Every vertex is visited twice. The probability that a face of the lattice on an n X infinity cylinder is surrounded by zero loops is conjectured to be given by a(n)/A_{HT}(n)^2, where A_{HT}(n) is the number of n X n half turn symmetric alternating sign matrices.A092372
The O(1) loop model on the square lattice is defined as follows: At every vertex the loop turns to the left or to the right with equal probability, unless the vertex has been visited before, in which case the loop leaves the vertex via the unused edge. Every vertex is visited twice. The probability that a face of the lattice on an n X infinity cylinder is surrounded by zero loops is conjectured to be given by a(n)/A_{HT}(n)^2, where A_{HT}(n) is the number of n X n half turn symmetric alternating sign matrices.
- The O(1) loop model on the square lattice is defined as follows: At every vertex the loop turns to the left or to the right with equal probability, unless the vertex has been visited before, in which case the loop leaves the vertex via the unused edge. Every vertex is visited twice. The probability that a face of the lattice on an n X infinity cylinder is surrounded by one loop is conjectured to be given by a(n)/A_{HT}(n)^2, where A_{HT}(n) is the number of n X n half turn symmetric alternating sign matrices.A092373
The O(1) loop model on the square lattice is defined as follows: At every vertex the loop turns to the left or to the right with equal probability, unless the vertex has been visited before, in which case the loop leaves the vertex via the unused edge. Every vertex is visited twice. The probability that a face of the lattice on an n X infinity cylinder is surrounded by one loop is conjectured to be given by a(n)/A_{HT}(n)^2, where A_{HT}(n) is the number of n X n half turn symmetric alternating sign matrices.
- The O(1) loop model on the square lattice is defined as follows: At every vertex the loop turns to the left or to the right with equal probability, unless the vertex has been visited before, in which case the loop leaves the vertex via the unused edge. Every vertex is visited twice. The probability that a face of the lattice on an n X infinity cylinder is surrounded by two loops is conjectured to be given by a(n)/A_{HT}(n)^2, where A_{HT}(n) is the number of n X n half turn symmetric alternating sign matrices.A092374
The O(1) loop model on the square lattice is defined as follows: At every vertex the loop turns to the left or to the right with equal probability, unless the vertex has been visited before, in which case the loop leaves the vertex via the unused edge. Every vertex is visited twice. The probability that a face of the lattice on an n X infinity cylinder is surrounded by two loops is conjectured to be given by a(n)/A_{HT}(n)^2, where A_{HT}(n) is the number of n X n half turn symmetric alternating sign matrices.
- The O(1) loop model on the square lattice is defined as follows: At every vertex the loop turns to the left or to the right with equal probability, unless the vertex has been visited before, in which case the loop leaves the vertex via the unused edge. Every vertex is visited twice. The probability that a face of the lattice on an n X infinity cylinder is surrounded by three loops is conjectured to be given by a(n)/A_{HT}(n)^2, where A_{HT}(n) is the number of n X n half turn symmetric alternating sign matrices.A092375
The O(1) loop model on the square lattice is defined as follows: At every vertex the loop turns to the left or to the right with equal probability, unless the vertex has been visited before, in which case the loop leaves the vertex via the unused edge. Every vertex is visited twice. The probability that a face of the lattice on an n X infinity cylinder is surrounded by three loops is conjectured to be given by a(n)/A_{HT}(n)^2, where A_{HT}(n) is the number of n X n half turn symmetric alternating sign matrices.
- The O(1) loop model on the square lattice is defined as follows: At every vertex the loop turns to the left or to the right with equal probability, unless the vertex has been visited before, in which case the loop leaves the vertex via the unused edge. Every vertex is visited twice. The probability that a face of the lattice on an n X infinity cylinder is surrounded by four loops is conjectured to be given by a(n)/A_{HT}(n)^2, where A_{HT}(n) is the number of n X n half turn symmetric alternating sign matrices.A092376
The O(1) loop model on the square lattice is defined as follows: At every vertex the loop turns to the left or to the right with equal probability, unless the vertex has been visited before, in which case the loop leaves the vertex via the unused edge. Every vertex is visited twice. The probability that a face of the lattice on an n X infinity cylinder is surrounded by four loops is conjectured to be given by a(n)/A_{HT}(n)^2, where A_{HT}(n) is the number of n X n half turn symmetric alternating sign matrices.
- The O(1) loop model on the square lattice is defined as follows: At every vertex the loop turns to the left or to the right with equal probability, unless the vertex has been visited before, in which case the loop leaves the vertex via the unused edge. Every vertex is visited twice. The probability that a face of the lattice on an n X infinity cylinder is surrounded by five loops is conjectured to be given by a(n)/A_{HT}(n)^2, where A_{HT}(n) is the number of n X n half turn symmetric alternating sign matrices.A092377
The O(1) loop model on the square lattice is defined as follows: At every vertex the loop turns to the left or to the right with equal probability, unless the vertex has been visited before, in which case the loop leaves the vertex via the unused edge. Every vertex is visited twice. The probability that a face of the lattice on an n X infinity cylinder is surrounded by five loops is conjectured to be given by a(n)/A_{HT}(n)^2, where A_{HT}(n) is the number of n X n half turn symmetric alternating sign matrices.
- The O(1) loop model on the square lattice is defined as follows: At every vertex the loop turns to the left or to the right with equal probability, unless the vertex has been visited before, in which case the loop leaves the vertex via the unused edge. Every vertex is visited twice. The probability that a face of the lattice on an n X infinity cylinder is surrounded by six loops is conjectured to be given by a(n)/A_{HT}(n)^2, where A_{HT}(n) is the number of n X n half turn symmetric alternating sign matrices.A092378
The O(1) loop model on the square lattice is defined as follows: At every vertex the loop turns to the left or to the right with equal probability, unless the vertex has been visited before, in which case the loop leaves the vertex via the unused edge. Every vertex is visited twice. The probability that a face of the lattice on an n X infinity cylinder is surrounded by six loops is conjectured to be given by a(n)/A_{HT}(n)^2, where A_{HT}(n) is the number of n X n half turn symmetric alternating sign matrices.
- The O(1) loop model on the square lattice is defined as follows: At every vertex the loop turns to the left or to the right with equal probability, unless the vertex has been visited before, in which case the loop leaves the vertex via the unused edge. Every vertex is visited twice. The probability that a face of the lattice on an n X infinity cylinder is surrounded by seven loops is conjectured to be given by a(n)/A_{HT}(n)^2, where A_{HT}(n) is the number of n X n half turn symmetric alternating sign matrices.A092379
The O(1) loop model on the square lattice is defined as follows: At every vertex the loop turns to the left or to the right with equal probability, unless the vertex has been visited before, in which case the loop leaves the vertex via the unused edge. Every vertex is visited twice. The probability that a face of the lattice on an n X infinity cylinder is surrounded by seven loops is conjectured to be given by a(n)/A_{HT}(n)^2, where A_{HT}(n) is the number of n X n half turn symmetric alternating sign matrices.
- The O(1) loop model on the square lattice is defined as follows: At every vertex the loop turns to the left or to the right with equal probability, unless the vertex has been visited before, in which case the loop leaves the vertex via the unused edge. Every vertex is visited twice. The probability that a face of the lattice on an n X infinity cylinder is surrounded by eight loops is conjectured to be given by a(n)/A_{HT}(n)^2, where A_{HT}(n) is the number of n X n half turn symmetric alternating sign matrices.A092380
The O(1) loop model on the square lattice is defined as follows: At every vertex the loop turns to the left or to the right with equal probability, unless the vertex has been visited before, in which case the loop leaves the vertex via the unused edge. Every vertex is visited twice. The probability that a face of the lattice on an n X infinity cylinder is surrounded by eight loops is conjectured to be given by a(n)/A_{HT}(n)^2, where A_{HT}(n) is the number of n X n half turn symmetric alternating sign matrices.
- The O(1) loop model on the square lattice is defined as follows: At every vertex the loop turns to the left or to the right with equal probability, unless the vertex has been visited before, in which case the loop leaves the vertex via the unused edge. Every vertex is visited twice. The probability that a face of the lattice on an n X infinity cylinder is surrounded by nine loops is conjectured to be given by a(n)/A_{HT}(n)^2, where A_{HT}(n) is the number of n X n half turn symmetric alternating sign matrices.A092381
The O(1) loop model on the square lattice is defined as follows: At every vertex the loop turns to the left or to the right with equal probability, unless the vertex has been visited before, in which case the loop leaves the vertex via the unused edge. Every vertex is visited twice. The probability that a face of the lattice on an n X infinity cylinder is surrounded by nine loops is conjectured to be given by a(n)/A_{HT}(n)^2, where A_{HT}(n) is the number of n X n half turn symmetric alternating sign matrices.
- The O(1) loop model on the square lattice is defined as follows: At every vertex the loop turns to the left or to the right with equal probability, unless the vertex has been visited before, in which case the loop leaves the vertex via the unused edge. Every vertex is visited twice. The probability that a face of the lattice on an n X infinity cylinder is surrounded by ten loops is conjectured to be given by a(n)/A_{HT}(n)^2, where A_{HT}(n) is the number of n X n half turn symmetric alternating sign matrices.A092382
The O(1) loop model on the square lattice is defined as follows: At every vertex the loop turns to the left or to the right with equal probability, unless the vertex has been visited before, in which case the loop leaves the vertex via the unused edge. Every vertex is visited twice. The probability that a face of the lattice on an n X infinity cylinder is surrounded by ten loops is conjectured to be given by a(n)/A_{HT}(n)^2, where A_{HT}(n) is the number of n X n half turn symmetric alternating sign matrices.
- Sum of digits of n if n odd, else sum of digits of 2n.A092383
Sum of digits of n if n odd, else sum of digits of 2n.
- Sum of digits of n if n even, else sum of digits of 2n.A092384
Sum of digits of n if n even, else sum of digits of 2n.
- Duplicate of A060248.A092385
Duplicate of A060248.
- Let p(n) = n-th prime; a(n) = largest prime factor of (p(n+1)^2 - p(n)*p(n+2)).A092386
Let p(n) = n-th prime; a(n) = largest prime factor of (p(n+1)^2 - p(n)*p(n+2)).
- a(n) = Fibonacci(2*n+1) + Fibonacci(2*n-1) + 2.A092387
a(n) = Fibonacci(2*n+1) + Fibonacci(2*n-1) + 2.
- a(n) is the smallest positive integer such that the product of all 1/(1-1/a(n)) is less than Pi.A092388
a(n) is the smallest positive integer such that the product of all 1/(1-1/a(n)) is less than Pi.
- a(n) is the smallest positive integer such that the product of all 1/(1-1/a(n)) is less than e, the base of natural logarithms.A092389
a(n) is the smallest positive integer such that the product of all 1/(1-1/a(n)) is less than e, the base of natural logarithms.
- a(n) = prime(n) + prime(2n).A092390
a(n) = prime(n) + prime(2n).
- a(n) = n + wt(n), where wt(n) = A000120(n) = binary weight of n.A092391
a(n) = n + wt(n), where wt(n) = A000120(n) = binary weight of n.
- Triangle read by rows: T(n,k) = C(2*n - k,n), 0 <= k <= n.A092392
Triangle read by rows: T(n,k) = C(2*n - k,n), 0 <= k <= n.
- Triangle read by rows: T(n,k) = (n+k)*binomial(n,k) (for k=0..n-1).A092393
Triangle read by rows: T(n,k) = (n+k)*binomial(n,k) (for k=0..n-1).
- Largest gcd of two distinct numbers on row n of Pascal's triangle.A092394
Largest gcd of two distinct numbers on row n of Pascal's triangle.
- Primes occurring as divisors of fibonacci(p) with p prime.A092395
Primes occurring as divisors of fibonacci(p) with p prime.
- Row 2 of array in A288580.A092396
Row 2 of array in A288580.
- Row 3 of array in A288580.A092397
Row 3 of array in A288580.
- Row 4 of array in A288580.A092398
Row 4 of array in A288580.
- Row 5 of array in A288580.A092399
Row 5 of array in A288580.
- Fixed point of the morphism 1 -> 1121211, 2 -> 1121212121211, starting from a(1) = 1.A092400
Fixed point of the morphism 1 -> 1121211, 2 -> 1121212121211, starting from a(1) = 1.
- List of pairs n, 3n, where n is the least unused number so far.A092401
List of pairs n, 3n, where n is the least unused number so far.
- Primes of the form p+8 where p is a prime.A092402
Primes of the form p+8 where p is a prime.
- a(n) = sigma(n) + sigma(n+1).A092403
a(n) = sigma(n) + sigma(n+1).
- a(n) = phi(n) + phi(n+1).A092404
a(n) = phi(n) + phi(n+1).
- a(n) = tau(n) + tau(n+1), where tau(n) = A000005(n), the number of divisors of n.A092405
a(n) = tau(n) + tau(n+1), where tau(n) = A000005(n), the number of divisors of n.
- a(1)=1, a(n) = sigma(n) if sigma(n) >= a(n-1), otherwise a(n) = a(n-1) + sigma(n).A092406
a(1)=1, a(n) = sigma(n) if sigma(n) >= a(n-1), otherwise a(n) = a(n-1) + sigma(n).
- Coins and notes in the Norwegian currency.A092407
Coins and notes in the Norwegian currency.
- Numbers k that divide 3^(k^3) + 1.A092408
Numbers k that divide 3^(k^3) + 1.
- Erroneous version of A007921.A092409
Erroneous version of A007921.
- a(n) = moebius(n)+moebius(n+1).A092410
a(n) = moebius(n)+moebius(n+1).