Sequences
392,541 sequences
- a(n) = n(n-1)(n-3)(n-6)...(n-t), where t is the largest triangular number less than n; number of factors in the product is ceiling((sqrt(1+8*n)-1)/2).A094261
a(n) = n(n-1)(n-3)(n-6)...(n-t), where t is the largest triangular number less than n; number of factors in the product is ceiling((sqrt(1+8*n)-1)/2).
- Triangle read by rows: T(n,k) is the number of rooted trees with k nodes which are disjoint sets of labels with union {1..n}. If a node has an empty set of labels then it must have at least two children.A094262
Triangle read by rows: T(n,k) is the number of rooted trees with k nodes which are disjoint sets of labels with union {1..n}. If a node has an empty set of labels then it must have at least two children.
- Triangle read by rows: for 1 <= k <= n, a(n, k) = n^k mod k.A094263
Triangle read by rows: for 1 <= k <= n, a(n, k) = n^k mod k.
- a(n) = Sum_{r = 1..n} (n^r mod r).A094264
a(n) = Sum_{r = 1..n} (n^r mod r).
- Largest number in n-th row of triangle A094263.A094265
Largest number in n-th row of triangle A094263.
- LQTL Lean Quaternary Temporal Logic: a terse form of temporal logic created by assigning four descriptors such that false, becoming true, true and becoming false are represented and become a linear sequence. In a branching tree two alternative are open, change or no change. The integer sequence above is the count of the row possibilities of the four states over successive iterations.A094266
LQTL Lean Quaternary Temporal Logic: a terse form of temporal logic created by assigning four descriptors such that false, becoming true, true and becoming false are represented and become a linear sequence. In a branching tree two alternative are open, change or no change. The integer sequence above is the count of the row possibilities of the four states over successive iterations.
- First differences of A001511.A094267
First differences of A001511.
- Starting term of smallest consecutive n-tuples of abundant numbers.A094268
Starting term of smallest consecutive n-tuples of abundant numbers.
- a(n) = phi(A003401(n)).A094269
a(n) = phi(A003401(n)).
- Triangle read by rows: row n contains the least set of n successive numbers whose product is a multiple of the product of the previous row. The first term of each row must be larger than the last term of the previous row.A094270
Triangle read by rows: row n contains the least set of n successive numbers whose product is a multiple of the product of the previous row. The first term of each row must be larger than the last term of the previous row.
- First column of triangle A094270. Equals A094272(n)-(n-1).A094271
First column of triangle A094270. Equals A094272(n)-(n-1).
- Least m >= a(n-1)+n such that m!/(m-n)! is a multiple of a(n-1)!/(a(n-1)-(n-1))!.A094272
Least m >= a(n-1)+n such that m!/(m-n)! is a multiple of a(n-1)!/(a(n-1)-(n-1))!.
- Row products of triangle A094270.A094273
Row products of triangle A094270.
- Ratio of successive row products of triangle A094270: A094273(n+1) / A094273(n).A094274
Ratio of successive row products of triangle A094270: A094273(n+1) / A094273(n).
- Triangle read by rows: for 1 <= k < n, a(n, k) is the least number not already used. For n > 1, a(n, n) is the least number not already used such that the product of the n-th row is a multiple of the product of the previous row.A094275
Triangle read by rows: for 1 <= k < n, a(n, k) is the least number not already used. For n > 1, a(n, n) is the least number not already used such that the product of the n-th row is a multiple of the product of the previous row.
- Leading diagonal of triangle A094275.A094276
Leading diagonal of triangle A094275.
- First column of triangle A094275.A094277
First column of triangle A094275.
- Product of terms in n-th row of triangle A094275.A094278
Product of terms in n-th row of triangle A094275.
- Ratios of consecutive row products of triangle A094275.A094279
Ratios of consecutive row products of triangle A094275.
- a(1)=1 (first row) and then the n-th row of this triangle contains the least set of n unused natural numbers whose sum is k * the sum of the previous row, with k being an integer > 1.A094280
a(1)=1 (first row) and then the n-th row of this triangle contains the least set of n unused natural numbers whose sum is k * the sum of the previous row, with k being an integer > 1.
- The leftmost column of triangle A094280.A094281
The leftmost column of triangle A094280.
- The rightmost column of triangle A094280.A094282
The rightmost column of triangle A094280.
- Row sums of triangle A094280.A094283
Row sums of triangle A094280.
- a(n) = A094283(n+1)/A094283(n).A094284
a(n) = A094283(n+1)/A094283(n).
- Right leading diagonal of the triangle described in comments.A094285
Right leading diagonal of the triangle described in comments.
- Number of (s(0), s(1), ..., s(n)) such that 0 < s(i) < 6 and |s(i) - s(i-1)| <= 1 for i = 1,2,...,n, s(0) = 1, s(n) = 1.A094286
Number of (s(0), s(1), ..., s(n)) such that 0 < s(i) < 6 and |s(i) - s(i-1)| <= 1 for i = 1,2,...,n, s(0) = 1, s(n) = 1.
- Number of (s(0), s(1), ..., s(n)) such that 0 < s(i) < 7 and |s(i) - s(i-1)| <= 1 for i = 1,2,...,n, s(0) = 1, s(n) = 1.A094287
Number of (s(0), s(1), ..., s(n)) such that 0 < s(i) < 7 and |s(i) - s(i-1)| <= 1 for i = 1,2,...,n, s(0) = 1, s(n) = 1.
- Number of (s(0), s(1), ..., s(n)) such that 0 < s(i) < 8 and |s(i) - s(i-1)| <= 1 for i = 1,2,...,n, s(0) = 1, s(n) = 1.A094288
Number of (s(0), s(1), ..., s(n)) such that 0 < s(i) < 8 and |s(i) - s(i-1)| <= 1 for i = 1,2,...,n, s(0) = 1, s(n) = 1.
- Decimal expansion of Sum(1/p^p) where p is prime.A094289
Decimal expansion of Sum(1/p^p) where p is prime.
- a(n) = prime(A001511(n)), where A001511 is one more than the 2-adic valuation of n.A094290
a(n) = prime(A001511(n)), where A001511 is one more than the 2-adic valuation of n.
- a(n) = maximal value of C(i, j) * C(n-j, n-i) for 0 <= j <= i <= n.A094291
a(n) = maximal value of C(i, j) * C(n-j, n-i) for 0 <= j <= i <= n.
- Number of (s(0), s(1), ..., s(n)) such that 0 < s(i) < 5 and |s(i) - s(i-1)| <= 1 for i = 1,2,...,n, s(0) = 2, s(n) = 4.A094292
Number of (s(0), s(1), ..., s(n)) such that 0 < s(i) < 5 and |s(i) - s(i-1)| <= 1 for i = 1,2,...,n, s(0) = 2, s(n) = 4.
- At the n-th step, append the number n and n copies of the list of all preceding terms, starting with an empty list.A094293
At the n-th step, append the number n and n copies of the list of all preceding terms, starting with an empty list.
- a(n) = n*a(n-1) - n + 2 for n > 1; a(1)=1.A094294
a(n) = n*a(n-1) - n + 2 for n > 1; a(1)=1.
- a(1) = 1, a(n) = remainder on dividing the concatenation of all previous terms by n.A094295
a(1) = 1, a(n) = remainder on dividing the concatenation of all previous terms by n.
- Concatenation of first (n-1) terms of A094295 - A094295(n) divided by n.A094296
Concatenation of first (n-1) terms of A094295 - A094295(n) divided by n.
- Number of (s(0), s(1), ..., s(n)) such that 0 < s(i) < 6 and |s(i) - s(i-1)| <= 1 for i = 1,2,...,n, s(0) = 2, s(n) = 2.A094297
Number of (s(0), s(1), ..., s(n)) such that 0 < s(i) < 6 and |s(i) - s(i-1)| <= 1 for i = 1,2,...,n, s(0) = 2, s(n) = 2.
- Numbers m such that m and its 10's complement are both semiprimes, i.e., m and 10^k - m, where k is the number of digits of m, are semiprime.A094298
Numbers m such that m and its 10's complement are both semiprimes, i.e., m and 10^k - m, where k is the number of digits of m, are semiprime.
- a(0) = 1; for n>0, if gcd(a(n-1),n) = 1 then a(n) = n*a(n-1) else a(n) = least integer multiple of a(n-1)/n.A094299
a(0) = 1; for n>0, if gcd(a(n-1),n) = 1 then a(n) = n*a(n-1) else a(n) = least integer multiple of a(n-1)/n.
- Duplicate of A055773.A094300
Duplicate of A055773.
- a(0)=0, a(1)=1, a(2)=2; for n>2, a(n) = a(n-1) - a(n-2) + a(n-3)^2.A094301
a(0)=0, a(1)=1, a(2)=2; for n>2, a(n) = a(n-1) - a(n-2) + a(n-3)^2.
- a(1) = 1; if n > a(n-1) then a(n) = n*a(n-1) else a(n) = least integer multiple of a(n-1)/n.A094302
a(1) = 1; if n > a(n-1) then a(n) = n*a(n-1) else a(n) = least integer multiple of a(n-1)/n.
- a(1) = 1, a(2) = 2, and a(n+1) = a(n) * sum of all previous terms up to a(n-1) for n >= 2.A094303
a(1) = 1, a(2) = 2, and a(n+1) = a(n) * sum of all previous terms up to a(n-1) for n >= 2.
- Sum of all possible sums formed from all but one of the previous terms, starting 1.A094304
Sum of all possible sums formed from all but one of the previous terms, starting 1.
- Triangle read by rows: T(n,k) = ((n+1)(n+2)/2) * binomial(n,k) (0 <= k <= n).A094305
Triangle read by rows: T(n,k) = ((n+1)(n+2)/2) * binomial(n,k) (0 <= k <= n).
- Number of (s(0), s(1), ..., s(n)) such that 0 < s(i) < 6 and |s(i) - s(i-1)| <= 1 for i = 1,2,...,n, s(0) = 2, s(n) = 4.A094306
Number of (s(0), s(1), ..., s(n)) such that 0 < s(i) < 6 and |s(i) - s(i-1)| <= 1 for i = 1,2,...,n, s(0) = 2, s(n) = 4.
- The k-th term of the n-th row of the following triangle is the least common multiple of all numbers from 1 to n except k. Sequence contains the triangle by rows.A094307
The k-th term of the n-th row of the following triangle is the least common multiple of all numbers from 1 to n except k. Sequence contains the triangle by rows.
- Row sums of A094307.A094308
Row sums of A094307.
- Number of (s(0), s(1), ..., s(n)) such that 0 < s(i) < 6 and |s(i) - s(i-1)| <= 1 for i = 1,2,...,n, s(0) = 2, s(n) = 5.A094309
Number of (s(0), s(1), ..., s(n)) such that 0 < s(i) < 6 and |s(i) - s(i-1)| <= 1 for i = 1,2,...,n, s(0) = 2, s(n) = 5.
- Triangle read by rows: T(n,k), the k-th term of the n-th row, is the product of all numbers from 1 to n except k: T(n,k) = n!/k.A094310
Triangle read by rows: T(n,k), the k-th term of the n-th row, is the product of all numbers from 1 to n except k: T(n,k) = n!/k.