Sequences
392,541 sequences
- Number of 7 X n binary arrays with a path of adjacent 1's from upper left corner to anywhere in right hand column.A069311
Number of 7 X n binary arrays with a path of adjacent 1's from upper left corner to anywhere in right hand column.
- Number of 8 X n binary arrays with a path of adjacent 1's from upper left corner to anywhere in right hand column.A069312
Number of 8 X n binary arrays with a path of adjacent 1's from upper left corner to anywhere in right hand column.
- Number of 9 X n binary arrays with a path of adjacent 1's from upper left corner to anywhere in right hand column.A069313
Number of 9 X n binary arrays with a path of adjacent 1's from upper left corner to anywhere in right hand column.
- 10 X n binary arrays with a path of adjacent 1's from upper left corner to anywhere in right hand column.A069314
10 X n binary arrays with a path of adjacent 1's from upper left corner to anywhere in right hand column.
- Number of 11 X n binary arrays with a path of adjacent 1's from upper left corner to anywhere in right hand column.A069315
Number of 11 X n binary arrays with a path of adjacent 1's from upper left corner to anywhere in right hand column.
- Number of 12 X n binary arrays with a path of adjacent 1's from upper left corner to anywhere in right hand column.A069316
Number of 12 X n binary arrays with a path of adjacent 1's from upper left corner to anywhere in right hand column.
- Number of 13 X n binary arrays with a path of adjacent 1's from upper left corner to anywhere in right hand column.A069317
Number of 13 X n binary arrays with a path of adjacent 1's from upper left corner to anywhere in right hand column.
- 14 X n binary arrays with a path of adjacent 1's from upper left corner to anywhere in right hand column.A069318
14 X n binary arrays with a path of adjacent 1's from upper left corner to anywhere in right hand column.
- Number of 15 X n binary arrays with a path of adjacent 1's from upper left corner to anywhere in right hand column.A069319
Number of 15 X n binary arrays with a path of adjacent 1's from upper left corner to anywhere in right hand column.
- Number of 16 X n binary arrays with a path of adjacent 1's from upper left corner to anywhere in right hand column.A069320
Number of 16 X n binary arrays with a path of adjacent 1's from upper left corner to anywhere in right hand column.
- Stirling transform of A001563: a(0) = 1 and a(n) = Sum_{k=1..n} Stirling2(n,k)*k*k! for n >= 1.A069321
Stirling transform of A001563: a(0) = 1 and a(n) = Sum_{k=1..n} Stirling2(n,k)*k*k! for n >= 1.
- Square array read by antidiagonals of floor[(n+k)^(n+k)/(n^n*k^k)].A069322
Square array read by antidiagonals of floor[(n+k)^(n+k)/(n^n*k^k)].
- Triangle in which n-th row gives ascending sequence of numbers derived from the (3x+1) problem, beginning with n. Numbers in one row share the same number of iteration steps required to reach the value of '1' when applying the (3x+1) algorithm. Each row terminates with a power of 2.A069323
Triangle in which n-th row gives ascending sequence of numbers derived from the (3x+1) problem, beginning with n. Numbers in one row share the same number of iteration steps required to reach the value of '1' when applying the (3x+1) algorithm. Each row terminates with a power of 2.
- Primes in A068949.A069324
Primes in A068949.
- Number of 3 X n binary arrays with path of adjacent 1's from upper right corner to lower left corner.A069325
Number of 3 X n binary arrays with path of adjacent 1's from upper right corner to lower left corner.
- Number of 4 X n binary arrays with path of adjacent 1's from upper right corner to lower left corner.A069326
Number of 4 X n binary arrays with path of adjacent 1's from upper right corner to lower left corner.
- Number of 5 X n binary arrays with path of adjacent 1's from upper right corner to lower left corner.A069327
Number of 5 X n binary arrays with path of adjacent 1's from upper right corner to lower left corner.
- Number of 6 X n binary arrays with path of adjacent 1's from upper right corner to lower left corner.A069328
Number of 6 X n binary arrays with path of adjacent 1's from upper right corner to lower left corner.
- Number of 7 X n binary arrays with path of adjacent 1's from upper right corner to lower left corner.A069329
Number of 7 X n binary arrays with path of adjacent 1's from upper right corner to lower left corner.
- Number of 8 X n binary arrays with path of adjacent 1's from upper right corner to lower left corner.A069330
Number of 8 X n binary arrays with path of adjacent 1's from upper right corner to lower left corner.
- Number of 9 X n binary arrays with path of adjacent 1's from upper right corner to lower left corner.A069331
Number of 9 X n binary arrays with path of adjacent 1's from upper right corner to lower left corner.
- Number of 10 X n binary arrays with path of adjacent 1's from upper right corner to lower left corner.A069332
Number of 10 X n binary arrays with path of adjacent 1's from upper right corner to lower left corner.
- Number of 11 X n binary arrays with path of adjacent 1's from upper right corner to lower left corner.A069333
Number of 11 X n binary arrays with path of adjacent 1's from upper right corner to lower left corner.
- Number of 12 X n binary arrays with path of adjacent 1's from upper right corner to lower left corner.A069334
Number of 12 X n binary arrays with path of adjacent 1's from upper right corner to lower left corner.
- Number of 13 X n binary arrays with path of adjacent 1's from upper right corner to lower left corner.A069335
Number of 13 X n binary arrays with path of adjacent 1's from upper right corner to lower left corner.
- Number of 14 X n binary arrays with path of adjacent 1's from upper right corner to lower left corner.A069336
Number of 14 X n binary arrays with path of adjacent 1's from upper right corner to lower left corner.
- Number of 15 X n binary arrays with path of adjacent 1's from upper right corner to lower left corner.A069337
Number of 15 X n binary arrays with path of adjacent 1's from upper right corner to lower left corner.
- Number of 16 X n binary arrays with path of adjacent 1's from upper right corner to lower left corner.A069338
Number of 16 X n binary arrays with path of adjacent 1's from upper right corner to lower left corner.
- Number of 17 X n binary arrays with path of adjacent 1's from upper right corner to lower left corner.A069339
Number of 17 X n binary arrays with path of adjacent 1's from upper right corner to lower left corner.
- Number of 18 X n binary arrays with path of adjacent 1's from upper right corner to lower left corner.A069340
Number of 18 X n binary arrays with path of adjacent 1's from upper right corner to lower left corner.
- Number of 19 X n binary arrays with path of adjacent 1's from upper right corner to lower left corner.A069341
Number of 19 X n binary arrays with path of adjacent 1's from upper right corner to lower left corner.
- Number of 20 X n binary arrays with path of adjacent 1's from upper right corner to lower left corner.A069342
Number of 20 X n binary arrays with path of adjacent 1's from upper right corner to lower left corner.
- Number of n X n binary arrays with path of adjacent 1's from upper right corner to lower left corner.A069343
Number of n X n binary arrays with path of adjacent 1's from upper right corner to lower left corner.
- Number of n X n symmetric binary arrays with path of adjacent 1's from upper right corner to lower left corner.A069344
Number of n X n symmetric binary arrays with path of adjacent 1's from upper right corner to lower left corner.
- n minus the number of its prime-factors: a(n) = n - A001222(n).A069345
n minus the number of its prime-factors: a(n) = n - A001222(n).
- Primes of the form n - Omega(n), where Omega(n) is the number of prime factors of n, A001222(n).A069346
Primes of the form n - Omega(n), where Omega(n) is the number of prime factors of n, A001222(n).
- Number of ways to represent primes as A069346(n)=k-A001222(k).A069347
Number of ways to represent primes as A069346(n)=k-A001222(k).
- Primes of the form k + Omega(k), where Omega(k) is the number of prime factors of k, A001222(k).A069348
Primes of the form k + Omega(k), where Omega(k) is the number of prime factors of k, A001222(k).
- Number of ways to represent primes as A069348(n)=k+A001222(k).A069349
Number of ways to represent primes as A069348(n)=k+A001222(k).
- Primes having no representation of the form n - A001222(n), complement of A069346.A069350
Primes having no representation of the form n - A001222(n), complement of A069346.
- Primes having no representation of the form n + A001222(n), complement of A069348.A069351
Primes having no representation of the form n + A001222(n), complement of A069348.
- Total number of prime factors of 3-smooth numbers.A069352
Total number of prime factors of 3-smooth numbers.
- Numbers of form 2^i*3^j - 1 with i, j >= 0.A069353
Numbers of form 2^i*3^j - 1 with i, j >= 0.
- Lowest base with simple divisibility test for n primes; smallest B such that omega(B) + omega(B-1) = n.A069354
Lowest base with simple divisibility test for n primes; smallest B such that omega(B) + omega(B-1) = n.
- Numbers of form 2^i*3^j - (i+j) with i, j >= 0.A069355
Numbers of form 2^i*3^j - (i+j) with i, j >= 0.
- Primes of the form 2^i*3^j - (i+j) with i, j >= 0.A069356
Primes of the form 2^i*3^j - (i+j) with i, j >= 0.
- Numbers of form 2^i*3^j + (i+j) with i, j >= 0.A069357
Numbers of form 2^i*3^j + (i+j) with i, j >= 0.
- Primes of the form 2^i*3^j + (i+j) with i, j >= 0.A069358
Primes of the form 2^i*3^j + (i+j) with i, j >= 0.
- a(n) = n * Sum_{p|n} 1/p where p are primes dividing n.A069359
a(n) = n * Sum_{p|n} 1/p where p are primes dividing n.
- Number of prime pairs (p,q), p <= q, such that (p+q)/2 = 2*n.A069360
Number of prime pairs (p,q), p <= q, such that (p+q)/2 = 2*n.