Sequences
392,541 sequences
- Duplicate of A026835.A079211
Duplicate of A026835.
- Numbers n in which the last k digits of n form an integer divisible by the k-th prime, for k = 1, 2, ..., m, where m is the number of digits in n.A079212
Numbers n in which the last k digits of n form an integer divisible by the k-th prime, for k = 1, 2, ..., m, where m is the number of digits in n.
- Triangle read by rows giving T(n,k) = number of sets of k black squares in an n X n checkerboard with the upper left corner colored black, such that the line joining any 2 squares slopes down to the right, 0 <= k <= n.A079213
Triangle read by rows giving T(n,k) = number of sets of k black squares in an n X n checkerboard with the upper left corner colored black, such that the line joining any 2 squares slopes down to the right, 0 <= k <= n.
- Catalan paths: numbers starting with 1 and ending with 0 where each digit is nonnegative and adjacent digits differ by 1.A079214
Catalan paths: numbers starting with 1 and ending with 0 where each digit is nonnegative and adjacent digits differ by 1.
- Catalan paths: numbers starting with 1 and ending with 1 where each digit is positive and adjacent digits differ by 1.A079215
Catalan paths: numbers starting with 1 and ending with 1 where each digit is positive and adjacent digits differ by 1.
- Square array A(n>=0,k>=1) (listed antidiagonally: A(0,1)=1, A(1,1)=1, A(0,2)=1, A(2,1)=2, A(1,2)=1, A(0,3)=1, A(3,1)=3, ...) giving the number of n-edge general plane trees fixed by k-fold application of Catalan Automorphisms A057511/A057512 (Deep rotation of general parenthesizations/plane trees).A079216
Square array A(n>=0,k>=1) (listed antidiagonally: A(0,1)=1, A(1,1)=1, A(0,2)=1, A(2,1)=2, A(1,2)=1, A(0,3)=1, A(3,1)=3, ...) giving the number of n-edge general plane trees fixed by k-fold application of Catalan Automorphisms A057511/A057512 (Deep rotation of general parenthesizations/plane trees).
- Triangle T(n,d) (listed row-wise: T(1,1)=1, T(2,1)=1, T(2,2)=1, T(3,1)=2, T(3,2)=0, T(3,3)=1, ...) giving the number of n-edge general plane trees with root degree d that are fixed by Catalan Automorphisms A057511/A057512 (Deep rotation of general parenthesizations/plane trees).A079217
Triangle T(n,d) (listed row-wise: T(1,1)=1, T(2,1)=1, T(2,2)=1, T(3,1)=2, T(3,2)=0, T(3,3)=1, ...) giving the number of n-edge general plane trees with root degree d that are fixed by Catalan Automorphisms A057511/A057512 (Deep rotation of general parenthesizations/plane trees).
- Triangle T(n,d) (listed row-wise: T(1,1)=1, T(2,1)=1, T(2,2)=1, T(3,1)=2, T(3,2)=2, T(3,3)=1, ...) giving the number of n-edge general plane trees with root degree d that are fixed by the two-fold application of Catalan Automorphisms A057511/A057512 (Deep rotation of general parenthesizations/plane trees).A079218
Triangle T(n,d) (listed row-wise: T(1,1)=1, T(2,1)=1, T(2,2)=1, T(3,1)=2, T(3,2)=2, T(3,3)=1, ...) giving the number of n-edge general plane trees with root degree d that are fixed by the two-fold application of Catalan Automorphisms A057511/A057512 (Deep rotation of general parenthesizations/plane trees).
- Triangle T(n,d) (listed row-wise: T(1,1)=1, T(2,1)=1, T(2,2)=1, T(3,1)=2, T(3,2)=0, T(3,3)=1, ...) giving the number of n-edge general plane trees with root degree d that are fixed by the three-fold application of Catalan Automorphisms A057511/A057512 (Deep rotation of general parenthesizations/plane trees).A079219
Triangle T(n,d) (listed row-wise: T(1,1)=1, T(2,1)=1, T(2,2)=1, T(3,1)=2, T(3,2)=0, T(3,3)=1, ...) giving the number of n-edge general plane trees with root degree d that are fixed by the three-fold application of Catalan Automorphisms A057511/A057512 (Deep rotation of general parenthesizations/plane trees).
- Triangle T(n,d) (listed row-wise: T(1,1)=1, T(2,1)=1, T(2,2)=1, T(3,1)=2, T(3,2)=2, T(3,3)=1, ...) giving the number of n-edge general plane trees with root degree d that are fixed by the four-fold application of Catalan Automorphisms A057511/A057512 (Deep rotation of general parenthesizations/plane trees).A079220
Triangle T(n,d) (listed row-wise: T(1,1)=1, T(2,1)=1, T(2,2)=1, T(3,1)=2, T(3,2)=2, T(3,3)=1, ...) giving the number of n-edge general plane trees with root degree d that are fixed by the four-fold application of Catalan Automorphisms A057511/A057512 (Deep rotation of general parenthesizations/plane trees).
- Triangle T(n,d) (listed row-wise: T(1,1)=1, T(2,1)=1, T(2,2)=1, T(3,1)=2, T(3,2)=0, T(3,3)=1, ...) giving the number of n-edge general plane trees with root degree d that are fixed by the five-fold application of Catalan Automorphisms A057511/A057512 (Deep rotation of general parenthesizations/plane trees).A079221
Triangle T(n,d) (listed row-wise: T(1,1)=1, T(2,1)=1, T(2,2)=1, T(3,1)=2, T(3,2)=0, T(3,3)=1, ...) giving the number of n-edge general plane trees with root degree d that are fixed by the five-fold application of Catalan Automorphisms A057511/A057512 (Deep rotation of general parenthesizations/plane trees).
- Triangle T(n,d) (listed row-wise: T(1,1)=1, T(2,1)=1, T(2,2)=1, T(3,1)=2, T(3,2)=2, T(3,3)=1, ...) giving the number of n-edge general plane trees with root degree d that are fixed by the six-fold application of Catalan Automorphisms A057511/A057512 (Deep rotation of general parenthesizations/plane trees).A079222
Triangle T(n,d) (listed row-wise: T(1,1)=1, T(2,1)=1, T(2,2)=1, T(3,1)=2, T(3,2)=2, T(3,3)=1, ...) giving the number of n-edge general plane trees with root degree d that are fixed by the six-fold application of Catalan Automorphisms A057511/A057512 (Deep rotation of general parenthesizations/plane trees).
- Number of Catalan objects fixed by two-fold application of the Catalan bijections A057511/A057512 (Deep rotation of general parenthesizations/plane trees).A079223
Number of Catalan objects fixed by two-fold application of the Catalan bijections A057511/A057512 (Deep rotation of general parenthesizations/plane trees).
- Number of Catalan objects fixed by three-fold application of the Catalan bijections A057511/A057512 (Deep rotation of general parenthesizations/plane trees).A079224
Number of Catalan objects fixed by three-fold application of the Catalan bijections A057511/A057512 (Deep rotation of general parenthesizations/plane trees).
- Number of Catalan objects fixed by four-fold application of the Catalan bijections A057511/A057512 (Deep rotation of general parenthesizations/plane trees).A079225
Number of Catalan objects fixed by four-fold application of the Catalan bijections A057511/A057512 (Deep rotation of general parenthesizations/plane trees).
- Number of Catalan objects fixed by five-fold application of the Catalan bijections A057511/A057512 (deep rotation of general parenthesizations/plane trees).A079226
Number of Catalan objects fixed by five-fold application of the Catalan bijections A057511/A057512 (deep rotation of general parenthesizations/plane trees).
- Number of Catalan objects fixed by six-fold application of the Catalan bijections A057511/A057512 (Deep rotation of general parenthesizations/plane trees).A079227
Number of Catalan objects fixed by six-fold application of the Catalan bijections A057511/A057512 (Deep rotation of general parenthesizations/plane trees).
- Least number > n with greater squarefree kernel than that of n.A079228
Least number > n with greater squarefree kernel than that of n.
- Least k>0 such that rad(n+k) > rad(n), where rad is the squarefree kernel (A007947).A079229
Least k>0 such that rad(n+k) > rad(n), where rad is the squarefree kernel (A007947).
- Number of non-associative non-commutative non-anti-associative non-anti-commutative closed binary operations on a set of order n.A079230
Number of non-associative non-commutative non-anti-associative non-anti-commutative closed binary operations on a set of order n.
- Number of isomorphism classes of non-associative non-commutative non-anti-associative non-anti-commutative closed binary operations on a set of order n.A079231
Number of isomorphism classes of non-associative non-commutative non-anti-associative non-anti-commutative closed binary operations on a set of order n.
- Number of non-associative non-commutative non-anti-associative anti-commutative closed binary operations on a set of order n.A079232
Number of non-associative non-commutative non-anti-associative anti-commutative closed binary operations on a set of order n.
- Number of isomorphism classes of non-associative non-commutative non-anti-associative anti-commutative closed binary operations on a set of order n.A079233
Number of isomorphism classes of non-associative non-commutative non-anti-associative anti-commutative closed binary operations on a set of order n.
- Number of non-associative non-commutative anti-associative non-anti-commutative closed binary operations on a set of order n.A079234
Number of non-associative non-commutative anti-associative non-anti-commutative closed binary operations on a set of order n.
- Number of isomorphism classes of non-associative non-commutative anti-associative non-anti-commutative closed binary operations on a set of order n.A079235
Number of isomorphism classes of non-associative non-commutative anti-associative non-anti-commutative closed binary operations on a set of order n.
- Number of non-associative non-commutative anti-associative anti-commutative closed binary operations on a set of order n.A079236
Number of non-associative non-commutative anti-associative anti-commutative closed binary operations on a set of order n.
- Number of isomorphism classes of non-associative non-commutative anti-associative anti-commutative closed binary operations on a set of order n.A079237
Number of isomorphism classes of non-associative non-commutative anti-associative anti-commutative closed binary operations on a set of order n.
- Numbers j in which the last K digits of j form an integer divisible by K^2, for K = 1, 2, ..., M, where M is the number of digits in j.A079238
Numbers j in which the last K digits of j form an integer divisible by K^2, for K = 1, 2, ..., M, where M is the number of digits in j.
- Numbers n in which the last K digits of n form an integer divisible by K^3, for K = 1, 2, ..., M, where M is the number of digits in n.A079239
Numbers n in which the last K digits of n form an integer divisible by K^3, for K = 1, 2, ..., M, where M is the number of digits in n.
- Number of associative non-commutative non-anti-associative non-anti-commutative closed binary operations on a set of order n.A079240
Number of associative non-commutative non-anti-associative non-anti-commutative closed binary operations on a set of order n.
- Number of isomorphism classes of associative non-commutative non-anti-associative non-anti-commutative closed binary operations on a set of order n.A079241
Number of isomorphism classes of associative non-commutative non-anti-associative non-anti-commutative closed binary operations on a set of order n.
- Number of associative non-commutative non-anti-associative anti-commutative closed binary operations on a set of order n.A079242
Number of associative non-commutative non-anti-associative anti-commutative closed binary operations on a set of order n.
- Number of isomorphism classes of associative non-commutative non-anti-associative anti-commutative closed binary operations on a set of order n.A079243
Number of isomorphism classes of associative non-commutative non-anti-associative anti-commutative closed binary operations on a set of order n.
- Number of associative commutative non-anti-associative non-anti-commutative closed binary operations on a set of order n.A079244
Number of associative commutative non-anti-associative non-anti-commutative closed binary operations on a set of order n.
- Number of isomorphism classes of associative commutative non-anti-associative non-anti-commutative closed binary operations on a set of order n.A079245
Number of isomorphism classes of associative commutative non-anti-associative non-anti-commutative closed binary operations on a set of order n.
- "Memory" of 2^n: the number of (previous) powers of 2 contained as substrings in 2^n.A079246
"Memory" of 2^n: the number of (previous) powers of 2 contained as substrings in 2^n.
- Number of pairs (p,q), 0 <= p < q, such that p+q divides n.A079247
Number of pairs (p,q), 0 <= p < q, such that p+q divides n.
- Sum of q in all pairs (p,q), 0 <= p < q, p+q divides n.A079248
Sum of q in all pairs (p,q), 0 <= p < q, p+q divides n.
- Sum of r in all pairs (r,s), 0<=r<s, r+s divides n.A079249
Sum of r in all pairs (r,s), 0<=r<s, r+s divides n.
- Even numbers in A079000.A079250
Even numbers in A079000.
- Complement of A079000.A079251
Complement of A079000.
- Even numbers not in A079000.A079252
Even numbers not in A079000.
- a(n) is taken to be the smallest positive integer greater than a(n-1) which is consistent with the condition "n is a member of the sequence if and only if a(n) is even".A079253
a(n) is taken to be the smallest positive integer greater than a(n-1) which is consistent with the condition "n is a member of the sequence if and only if a(n) is even".
- a(n) is taken to be the smallest positive integer greater than a(n-1) which is consistent with the condition "n is a member of the sequence if and only if a(n) is prime".A079254
a(n) is taken to be the smallest positive integer greater than a(n-1) which is consistent with the condition "n is a member of the sequence if and only if a(n) is prime".
- a(n) is taken to be the smallest positive integer greater than a(n-1) such that the condition "n is in the sequence if and only if a(n) is odd and a(n+1) is even" can be satisfied.A079255
a(n) is taken to be the smallest positive integer greater than a(n-1) such that the condition "n is in the sequence if and only if a(n) is odd and a(n+1) is even" can be satisfied.
- a(n) is taken to be the smallest positive integer greater than a(n-1) which is consistent with the condition "n is a member of the sequence if and only if a(n) is a power of 2".A079256
a(n) is taken to be the smallest positive integer greater than a(n-1) which is consistent with the condition "n is a member of the sequence if and only if a(n) is a power of 2".
- a(n) is taken to be the smallest positive integer greater than a(n-1) which is consistent with the condition "n is a member of the sequence if and only if a(n) is a triangular number".A079257
a(n) is taken to be the smallest positive integer greater than a(n-1) which is consistent with the condition "n is a member of the sequence if and only if a(n) is a triangular number".
- a(n) is taken to be the smallest positive integer greater than a(n-1) which is consistent with the condition "n is a member of the sequence if and only if a(n) is a square".A079258
a(n) is taken to be the smallest positive integer greater than a(n-1) which is consistent with the condition "n is a member of the sequence if and only if a(n) is a square".
- a(n) is taken to be the smallest positive integer greater than a(n-1) such that the condition "n is in the sequence if and only if a(n) and a(n+1) are both odd" can be satisfied.A079259
a(n) is taken to be the smallest positive integer greater than a(n-1) such that the condition "n is in the sequence if and only if a(n) and a(n+1) are both odd" can be satisfied.
- Characteristic function of primes of form 4n+1 (1 if n is prime of form 4n+1, 0 otherwise).A079260
Characteristic function of primes of form 4n+1 (1 if n is prime of form 4n+1, 0 otherwise).