Sequences
392,541 sequences
- Number of deterministic completely defined initially connected acyclic automata with 2 inputs and n transient unlabeled states (and a unique absorbing state).A082161
Number of deterministic completely defined initially connected acyclic automata with 2 inputs and n transient unlabeled states (and a unique absorbing state).
- Number of deterministic completely defined initially connected acyclic automata with 3 inputs and n transient unlabeled states (and a unique absorbing state).A082162
Number of deterministic completely defined initially connected acyclic automata with 3 inputs and n transient unlabeled states (and a unique absorbing state).
- Number of deterministic completely defined initially connected acyclic automata with 2 inputs and n+1 transient unlabeled states including a unique state having all transitions to the absorbing state.A082163
Number of deterministic completely defined initially connected acyclic automata with 2 inputs and n+1 transient unlabeled states including a unique state having all transitions to the absorbing state.
- Deterministic completely defined initially connected acyclic automata with 3 inputs and n+1 transient unlabeled states including a unique state having all transitions to the absorbing state.A082164
Deterministic completely defined initially connected acyclic automata with 3 inputs and n+1 transient unlabeled states including a unique state having all transitions to the absorbing state.
- Duplicate of A006689.A082165
Duplicate of A006689.
- a(n) = A006689(n)/n^2.A082166
a(n) = A006689(n)/n^2.
- Duplicate of A006690.A082167
Duplicate of A006690.
- a(n) = A006690(n)/n^3.A082168
a(n) = A006690(n)/n^3.
- Deterministic completely defined quasi-acyclic automata with 2 inputs, n transient and k absorbing labeled states.A082169
Deterministic completely defined quasi-acyclic automata with 2 inputs, n transient and k absorbing labeled states.
- Deterministic completely defined quasi-acyclic automata with 3 inputs, n transient and k absorbing labeled states.A082170
Deterministic completely defined quasi-acyclic automata with 3 inputs, n transient and k absorbing labeled states.
- A subclass of quasi-acyclic automata with 2 inputs, n transient and k absorbing labeled states; square array T(n,k) read by descending antidiagonals (n >= 0 and k >= 1).A082171
A subclass of quasi-acyclic automata with 2 inputs, n transient and k absorbing labeled states; square array T(n,k) read by descending antidiagonals (n >= 0 and k >= 1).
- A subclass of quasi-acyclic automata with 3 inputs, n transient and k absorbing labeled states.A082172
A subclass of quasi-acyclic automata with 3 inputs, n transient and k absorbing labeled states.
- a(0)=1; for n >= 1, a(n) = Sum_{k=0..n} 11^k*N(n,k) where N(n,k) = (1/n)*C(n,k)*C(n,k+1) are the Narayana numbers (A001263).A082173
a(0)=1; for n >= 1, a(n) = Sum_{k=0..n} 11^k*N(n,k) where N(n,k) = (1/n)*C(n,k)*C(n,k+1) are the Narayana numbers (A001263).
- Number of primitive reduced indefinite quadratic forms over the integers in two variables with discriminants D(n)=A079896(n).A082174
Number of primitive reduced indefinite quadratic forms over the integers in two variables with discriminants D(n)=A079896(n).
- Number of reduced indefinite quadratic forms over the integers in two variables with discriminants D(n)=A079896(n).A082175
Number of reduced indefinite quadratic forms over the integers in two variables with discriminants D(n)=A079896(n).
- Professor E. P. B. Umbugio's sequence.A082176
Professor E. P. B. Umbugio's sequence.
- Professor Umbugio's sequence A082176 divided by 1946.A082177
Professor Umbugio's sequence A082176 divided by 1946.
- Professor Umbugio's sequence A082176 divided by 2*7*53*139 = 103138.A082178
Professor Umbugio's sequence A082176 divided by 2*7*53*139 = 103138.
- (c(p)-2)/p where p runs through the primes and where c(p) denotes the p-th Catalan number = binomial(2*p,p)/(p+1).A082179
(c(p)-2)/p where p runs through the primes and where c(p) denotes the p-th Catalan number = binomial(2*p,p)/(p+1).
- Composite integers k such that binomial(2*k, k) == 2 (mod k).A082180
Composite integers k such that binomial(2*k, k) == 2 (mod k).
- a(0) = 1, for n>=1, a(n) = Sum_{k=0..n} 9^k*N(n,k), where N(n,k) = (1/n)*C(n,k)*C(n,k+1) are the Narayana numbers (A001263).A082181
a(0) = 1, for n>=1, a(n) = Sum_{k=0..n} 9^k*N(n,k), where N(n,k) = (1/n)*C(n,k)*C(n,k+1) are the Narayana numbers (A001263).
- Numbers k such that (5^k - 2^k)/3 is prime.A082182
Numbers k such that (5^k - 2^k)/3 is prime.
- Smallest k > 0 such that T(n) + T(k) = T(m), for some m, T(i) being the triangular numbers, n > 1.A082183
Smallest k > 0 such that T(n) + T(k) = T(m), for some m, T(i) being the triangular numbers, n > 1.
- The a(n)-th triangular number is the sum of the n-th triangular number and the smallest triangular number possible.A082184
The a(n)-th triangular number is the sum of the n-th triangular number and the smallest triangular number possible.
- Triangle read by rows: n-th row contains concatenations of nonempty subsets of {1, 2, ..., n}, ordered first by size and then lexicographically.A082185
Triangle read by rows: n-th row contains concatenations of nonempty subsets of {1, 2, ..., n}, ordered first by size and then lexicographically.
- 1 + sum of first n terms of A001221.A082186
1 + sum of first n terms of A001221.
- First row of square array A082025.A082187
First row of square array A082025.
- First column of square array A082025.A082188
First column of square array A082025.
- Main diagonal of square array A082025.A082189
Main diagonal of square array A082025.
- Antidiagonal sums of square array A082025.A082190
Antidiagonal sums of square array A082025.
- In a square array, positive integers are entered as follows. Start with a(1, 1)=1. Then enter numbers in this order: a(1, 2), a(2, 1), a(3, 1), a(2, 2), a(1, 3), a(1, 4), a(2, 3), a(3, 2), a(4, 1), a(5, 1), a(4, 2), ... such that every entry is the smallest not yet used and such that every entry greater than 1 has a common divisor with its neighbors (in all directions) which are greater than 1.A082191
In a square array, positive integers are entered as follows. Start with a(1, 1)=1. Then enter numbers in this order: a(1, 2), a(2, 1), a(3, 1), a(2, 2), a(1, 3), a(1, 4), a(2, 3), a(3, 2), a(4, 1), a(5, 1), a(4, 2), ... such that every entry is the smallest not yet used and such that every entry greater than 1 has a common divisor with its neighbors (in all directions) which are greater than 1.
- First row of array in A082191.A082192
First row of array in A082191.
- First column of array in A082191.A082193
First column of array in A082191.
- Main diagonal of array in A082191.A082194
Main diagonal of array in A082191.
- Sum of n-th antidiagonal of A082191.A082195
Sum of n-th antidiagonal of A082191.
- Triangle read by rows in which the n-th row contains n distinct numbers (not occurring earlier) such that every entry is coprime to its neighbor in all directions.A082196
Triangle read by rows in which the n-th row contains n distinct numbers (not occurring earlier) such that every entry is coprime to its neighbor in all directions.
- Diagonal of triangle in A082196.A082197
Diagonal of triangle in A082196.
- First column of triangle in A082196.A082198
First column of triangle in A082196.
- Sum of n-th row of triangle in A082196.A082199
Sum of n-th row of triangle in A082196.
- Triangle T(j,k) for 1 <= k <= j is filled row by row in the following manner: T(1,1) = 1; T(j,k) is the smallest nonprime number not yet used which is coprime to its left, left upper, upper and right upper neighbor, provided that such a neighbor exists (i.e., belongs to the triangle). Sequence contains the triangle by rows.A082200
Triangle T(j,k) for 1 <= k <= j is filled row by row in the following manner: T(1,1) = 1; T(j,k) is the smallest nonprime number not yet used which is coprime to its left, left upper, upper and right upper neighbor, provided that such a neighbor exists (i.e., belongs to the triangle). Sequence contains the triangle by rows.
- Last terms in the rows (main diagonal) of the triangle described in A082200.A082201
Last terms in the rows (main diagonal) of the triangle described in A082200.
- First column of the triangle described in A082200.A082202
First column of the triangle described in A082200.
- Row sums of the triangle described in A082200.A082203
Row sums of the triangle described in A082200.
- Begin with a 1, then place the smallest (as far as possible distinct) digits, such that, beginning from the n-th term, n terms form a palindrome.A082204
Begin with a 1, then place the smallest (as far as possible distinct) digits, such that, beginning from the n-th term, n terms form a palindrome.
- Palindromes pertaining to A082204.A082205
Palindromes pertaining to A082204.
- Digit sum of A082205(n).A082206
Digit sum of A082205(n).
- Palindromes whose product of digits is a positive palindrome.A082207
Palindromes whose product of digits is a positive palindrome.
- Palindromes for which the sum of the digits is also a palindrome.A082208
Palindromes for which the sum of the digits is also a palindrome.
- a(1) = 1, a(n) = smallest number such that the concatenation of a(n-1) and a(n) is a square.A082209
a(1) = 1, a(n) = smallest number such that the concatenation of a(n-1) and a(n) is a square.
- Square root of the squares arising in A082209.A082210
Square root of the squares arising in A082209.