Sequences
392,541 sequences
- Numbers k such that k | 8^k + 7^k + 6^k + 5^k + 4^k + 3^k.A057261
Numbers k such that k | 8^k + 7^k + 6^k + 5^k + 4^k + 3^k.
- Numbers n such that n | 7^n + 6^n + 5^n + 4^n + 3^n + 2^n.A057262
Numbers n such that n | 7^n + 6^n + 5^n + 4^n + 3^n + 2^n.
- Numbers n such that n | 12^n + 11^n + 10^n + 9^n + 8^n + 7^n + 6^n.A057263
Numbers n such that n | 12^n + 11^n + 10^n + 9^n + 8^n + 7^n + 6^n.
- Numbers n such that n | 11^n + 10^n + 9^n + 8^n + 7^n + 6^n + 5^n.A057264
Numbers n such that n | 11^n + 10^n + 9^n + 8^n + 7^n + 6^n + 5^n.
- Even refactorable numbers (i.e., the number of divisors is itself a divisor and it is also even).A057265
Even refactorable numbers (i.e., the number of divisors is itself a divisor and it is also even).
- Numbers n such that n | 10^n + 9^n + 8^n + 7^n + 6^n + 5^n + 4^n.A057266
Numbers n such that n | 10^n + 9^n + 8^n + 7^n + 6^n + 5^n + 4^n.
- Numbers n such that n | 9^n + 8^n + 7^n + 6^n + 5^n + 4^n + 3^n.A057267
Numbers n such that n | 9^n + 8^n + 7^n + 6^n + 5^n + 4^n + 3^n.
- a(n-1)+k=a(n) => a(n)*k=a(n+1).A057268
a(n-1)+k=a(n) => a(n)*k=a(n+1).
- a(n-1)+k=a(n) => a(n)^k=a(n+1).A057269
a(n-1)+k=a(n) => a(n)^k=a(n+1).
- Triangle T(n,k) of number of unilaterally connected digraphs on n unlabeled nodes with k arcs, k=0..n*(n-1).A057270
Triangle T(n,k) of number of unilaterally connected digraphs on n unlabeled nodes with k arcs, k=0..n*(n-1).
- Triangle T(n,k) of number of digraphs with a source and a sink on n labeled nodes and k arcs, k=0,1,..,n*(n-1).A057271
Triangle T(n,k) of number of digraphs with a source and a sink on n labeled nodes and k arcs, k=0,1,..,n*(n-1).
- Triangle T(n,k) of number of digraphs with a quasi-source on n labeled nodes and with k arcs, k=0,1,..,n*(n-1).A057272
Triangle T(n,k) of number of digraphs with a quasi-source on n labeled nodes and with k arcs, k=0,1,..,n*(n-1).
- Triangle T(n,k) of the number of strongly connected digraphs on n labeled nodes and with k arcs, k=0..n*(n-1).A057273
Triangle T(n,k) of the number of strongly connected digraphs on n labeled nodes and with k arcs, k=0..n*(n-1).
- Triangle T(n,k) of the number of digraphs with a source on n labeled nodes with k arcs, k=0..n*(n-1).A057274
Triangle T(n,k) of the number of digraphs with a source on n labeled nodes with k arcs, k=0..n*(n-1).
- Triangle T(n,k) of number of unilaterally connected digraphs on n labeled nodes and with k arcs, k=0..n*(n-1).A057275
Triangle T(n,k) of number of unilaterally connected digraphs on n labeled nodes and with k arcs, k=0..n*(n-1).
- Triangle T(n,k) of number of strongly connected digraphs on n unlabeled nodes and with k arcs, k=0..n*(n-1).A057276
Triangle T(n,k) of number of strongly connected digraphs on n unlabeled nodes and with k arcs, k=0..n*(n-1).
- Triangle T(n,k) of number of digraphs with a source on n unlabeled nodes with k arcs, k=0..n*(n-1).A057277
Triangle T(n,k) of number of digraphs with a source on n unlabeled nodes with k arcs, k=0..n*(n-1).
- Triangle T(n,k) of number of digraphs with a source and a sink on n unlabeled nodes and k arcs, k=0..n*(n-1).A057278
Triangle T(n,k) of number of digraphs with a source and a sink on n unlabeled nodes and k arcs, k=0..n*(n-1).
- Triangle T(n,k) of number of digraphs with a quasi-source on n unlabeled nodes and with k arcs, k = 0..n*(n-1).A057279
Triangle T(n,k) of number of digraphs with a quasi-source on n unlabeled nodes and with k arcs, k = 0..n*(n-1).
- Coefficient triangle of polynomials (rising powers) related to Fibonacci convolutions. Companion triangle to A057995.A057280
Coefficient triangle of polynomials (rising powers) related to Fibonacci convolutions. Companion triangle to A057995.
- Coefficient triangle of polynomials (falling powers) related to Fibonacci convolutions. Companion triangle to A057282.A057281
Coefficient triangle of polynomials (falling powers) related to Fibonacci convolutions. Companion triangle to A057282.
- Coefficient triangle of polynomials (falling powers) related to Fibonacci convolutions. Companion triangle to A057281.A057282
Coefficient triangle of polynomials (falling powers) related to Fibonacci convolutions. Companion triangle to A057281.
- Numbers k such that k | 10^k + 9^k + 8^k + 7^k + 6^k + 5^k + 4^k + 3^k.A057283
Numbers k such that k | 10^k + 9^k + 8^k + 7^k + 6^k + 5^k + 4^k + 3^k.
- Numbers n such that n | 9^n + 8^n + 7^n + 6^n + 5^n + 4^n + 3^n + 2^n.A057284
Numbers n such that n | 9^n + 8^n + 7^n + 6^n + 5^n + 4^n + 3^n + 2^n.
- Numbers n such that n | 12^n + 11^n + 10^n + 9^n + 8^n + 7^n + 6^n + 5^n + 4^n.A057285
Numbers n such that n | 12^n + 11^n + 10^n + 9^n + 8^n + 7^n + 6^n + 5^n + 4^n.
- Numbers k such that k | 11^k + 10^k + 9^k + 8^k + 7^k + 6^k + 5^k + 4^k + 3^k.A057286
Numbers k such that k | 11^k + 10^k + 9^k + 8^k + 7^k + 6^k + 5^k + 4^k + 3^k.
- Numbers n such that n | 10^n + 9^n + 8^n + 7^n + 6^n + 5^n + 4^n + 3^n + 2^n.A057287
Numbers n such that n | 10^n + 9^n + 8^n + 7^n + 6^n + 5^n + 4^n + 3^n + 2^n.
- Numbers n such that n | 11^n + 10^n + 9^n + 8^n + 7^n + 6^n + 5^n + 4^n + 3^n + 2^n.A057288
Numbers n such that n | 11^n + 10^n + 9^n + 8^n + 7^n + 6^n + 5^n + 4^n + 3^n + 2^n.
- Numbers n such that n | 12^n + 11^n + 10^n + 9^n + 8^n + 7^n + 6^n + 5^n + 4^n + 3^n.A057289
Numbers n such that n | 12^n + 11^n + 10^n + 9^n + 8^n + 7^n + 6^n + 5^n + 4^n + 3^n.
- Numbers n such that n | 12^n + 11^n + 10^n + 9^n + 8^n + 7^n + 6^n + 5^n + 4^n + 3^n + 2^n.A057290
Numbers n such that n | 12^n + 11^n + 10^n + 9^n + 8^n + 7^n + 6^n + 5^n + 4^n + 3^n + 2^n.
- Numbers k such that k | 12^k + 11^k + 10^k + 9^k + 8^k + 7^k + 6^k + 5^k + 4^k + 3^k + 2^k + 1^k.A057291
Numbers k such that k | 12^k + 11^k + 10^k + 9^k + 8^k + 7^k + 6^k + 5^k + 4^k + 3^k + 2^k + 1^k.
- Numbers k such that k | 11^k + 10^k + 9^k + 8^k + 7^k + 6^k + 5^k + 4^k + 3^k + 2^k + 1^k.A057292
Numbers k such that k | 11^k + 10^k + 9^k + 8^k + 7^k + 6^k + 5^k + 4^k + 3^k + 2^k + 1^k.
- Numbers k such that k | 12^k + 11^k + 1.A057293
Numbers k such that k | 12^k + 11^k + 1.
- Numbers n such that n | 11^n + 10^n + 1.A057294
Numbers n such that n | 11^n + 10^n + 1.
- Numbers n such that n | 10^n + 9^n + 1.A057295
Numbers n such that n | 10^n + 9^n + 1.
- Numbers n such that n | 9^n + 8^n + 1.A057296
Numbers n such that n | 9^n + 8^n + 1.
- Numbers n such that n | 8^n + 7^n + 1.A057297
Numbers n such that n | 8^n + 7^n + 1.
- Numbers n such that n | 7^n + 6^n + 1.A057298
Numbers n such that n | 7^n + 6^n + 1.
- Numbers n such that n | 6^n + 5^n + 1.A057299
Numbers n such that n | 6^n + 5^n + 1.
- Binary counter with odd/even bit positions swapped; base-4 counter with 1's replaced by 2's and vice versa.A057300
Binary counter with odd/even bit positions swapped; base-4 counter with 1's replaced by 2's and vice versa.
- Binary counter with bit positions permuted in increasing length cycles: 0;2,1;5,3,4;9,6,7,8,...A057301
Binary counter with bit positions permuted in increasing length cycles: 0;2,1;5,3,4;9,6,7,8,...
- Numbers n such that n | 5^n + 4^n + 1.A057302
Numbers n such that n | 5^n + 4^n + 1.
- Numbers n such that the number of distinct digits in n is a digit of n.A057303
Numbers n such that the number of distinct digits in n is a digit of n.
- Coordination sequence T1 for Zeolite Code MTF.A057304
Coordination sequence T1 for Zeolite Code MTF.
- Coordination sequence T2 for Zeolite Code MTF.A057305
Coordination sequence T2 for Zeolite Code MTF.
- Coordination sequence T3 for Zeolite Code MTF.A057306
Coordination sequence T3 for Zeolite Code MTF.
- Coordination sequence T4 for Zeolite Code MTF.A057307
Coordination sequence T4 for Zeolite Code MTF.
- Coordination sequence T5 for Zeolite Code MTF.A057308
Coordination sequence T5 for Zeolite Code MTF.
- Coordination sequence T6 for Zeolite Code MTF.A057309
Coordination sequence T6 for Zeolite Code MTF.
- Duplicate of A008084.A057310
Duplicate of A008084.