Sequences
392,541 sequences
- Divide n by the largest factorial that divides it and repeat until an odd number is reached, which will be the result; a(0) = 0.A093411
Divide n by the largest factorial that divides it and repeat until an odd number is reached, which will be the result; a(0) = 0.
- Triangle read by rows: a(n, k) is the numerator of (n + (n-1) + ... + (n-k+1))/(1 + 2 + ... + k), 0 < k <= n.A093412
Triangle read by rows: a(n, k) is the numerator of (n + (n-1) + ... + (n-k+1))/(1 + 2 + ... + k), 0 < k <= n.
- Largest number in row n of A093412.A093413
Largest number in row n of A093412.
- Row sums of A093412.A093414
Row sums of A093412.
- Triangle read by rows: a(n, k) is the denominator of (n + (n-1) + ... + (n-k+1))/(1 + 2 + ... + k), 0 < k <= n.A093415
Triangle read by rows: a(n, k) is the denominator of (n + (n-1) + ... + (n-k+1))/(1 + 2 + ... + k), 0 < k <= n.
- Index of first occurrence of prime(n) in A034694.A093416
Index of first occurrence of prime(n) in A034694.
- Row sums of A093415.A093417
Row sums of A093415.
- Numerator of -3*n + 2*(1+n)*HarmonicNumber(n).A093418
Numerator of -3*n + 2*(1+n)*HarmonicNumber(n).
- Denominators of row sums in triangle described in A093412.A093419
Denominators of row sums in triangle described in A093412.
- Triangle read by rows: T(n,k) is the numerator of f(n, k) = (Product_{i = 0..k-1} (n-i))/(Sum_{i = 1..k} i) for 1 <= k <= n.A093420
Triangle read by rows: T(n,k) is the numerator of f(n, k) = (Product_{i = 0..k-1} (n-i))/(Sum_{i = 1..k} i) for 1 <= k <= n.
- Triangle read by rows: T(n,k) is the denominator of f(n, k) = (Product_{i = 0..k-1} (n-i))/(Sum_{i = 1..k} i) for 1 <= k <= n.A093421
Triangle read by rows: T(n,k) is the denominator of f(n, k) = (Product_{i = 0..k-1} (n-i))/(Sum_{i = 1..k} i) for 1 <= k <= n.
- In the triangle shown below the n-th row contains n rational numbers n/1, {n*(n-1)}/{n +(n-1)}, {(n)*(n-1)*(n-2)}/{n +(n-1)+(n-2)}, ..., the last term being 2*(n-1)!/(n+1). Sequence gives the numerators in each row.A093422
In the triangle shown below the n-th row contains n rational numbers n/1, {n*(n-1)}/{n +(n-1)}, {(n)*(n-1)*(n-2)}/{n +(n-1)+(n-2)}, ..., the last term being 2*(n-1)!/(n+1). Sequence gives the numerators in each row.
- Consider the triangle whose first part is shown as an example in the entry A093422. If the n-th term of the triangle read by rows is a fraction then a(n) is the denominator of the fraction, otherwise a(n)=1.A093423
Consider the triangle whose first part is shown as an example in the entry A093422. If the n-th term of the triangle read by rows is a fraction then a(n) is the denominator of the fraction, otherwise a(n)=1.
- Number of two-dimensional burst patterns of size n, i.e., translation inequivalent subsets of the grid Z^2 which can be covered by a connected subset of n elements (in the sense of von Neumann neighborhoods).A093424
Number of two-dimensional burst patterns of size n, i.e., translation inequivalent subsets of the grid Z^2 which can be covered by a connected subset of n elements (in the sense of von Neumann neighborhoods).
- Erroneous version of A075399.A093425
Erroneous version of A075399.
- Number of different two-dimensional burst patterns in the hexagonal graph.A093426
Number of different two-dimensional burst patterns in the hexagonal graph.
- Number of different two-dimensional burst patterns in the grid graph with eight neighbors.A093427
Number of different two-dimensional burst patterns in the grid graph with eight neighbors.
- Prime numbers which are successors of a power of a Fibonacci number.A093428
Prime numbers which are successors of a power of a Fibonacci number.
- Number of distinct prime factors of (prime(1)*...*prime(n))+(prime(n+1)*...*prime(2n)), where prime(n) is the n-th prime.A093429
Number of distinct prime factors of (prime(1)*...*prime(n))+(prime(n+1)*...*prime(2n)), where prime(n) is the n-th prime.
- Triangle read by rows: T(n,k) = lcm(n, n-1, ..., n-k+2, n-k+1)/lcm(1, 2, ..., k) (1 <= k <= n).A093430
Triangle read by rows: T(n,k) = lcm(n, n-1, ..., n-k+2, n-k+1)/lcm(1, 2, ..., k) (1 <= k <= n).
- a(n) = Sum_{k=1..n} (lcm(n,n-1,...,n-k+2,n-k+1)/lcm(1,2,...,k)).A093431
a(n) = Sum_{k=1..n} (lcm(n,n-1,...,n-k+2,n-k+1)/lcm(1,2,...,k)).
- a(n) = lcm_{k=1..n} (lcm(n,n-1,...,n-k+2,n-k+1)/lcm(1,2,...,k)).A093432
a(n) = lcm_{k=1..n} (lcm(n,n-1,...,n-k+2,n-k+1)/lcm(1,2,...,k)).
- a(n) = (p(1)*...*p(n)) + (p(n+1)*...*p(2n)) where p(n) is the n-th prime.A093433
a(n) = (p(1)*...*p(n)) + (p(n+1)*...*p(2n)) where p(n) is the n-th prime.
- a(n) = Product_{i=1..n} (2*n-i)*(2*n+i).A093434
a(n) = Product_{i=1..n} (2*n-i)*(2*n+i).
- Duplicate of A048964.A093435
Duplicate of A048964.
- Decimal expansion of exp(Pi*sqrt(67)).A093436
Decimal expansion of exp(Pi*sqrt(67)).
- a(n) = largest prime of the form n!/k! + 1.A093437
a(n) = largest prime of the form n!/k! + 1.
- Least distinct prime p such that p-1 has the prime signature of n, or 0 if no such prime exists.A093438
Least distinct prime p such that p-1 has the prime signature of n, or 0 if no such prime exists.
- Least number n with a given prime signature such that all numbers >= n with this prime signature are one less than a composite number.A093439
Least number n with a given prime signature such that all numbers >= n with this prime signature are one less than a composite number.
- Number of n X n symmetric binary matrices with each element either the sum mod 2 of its diagonal neighbors or the sum mod 2 of its antidiagonal neighbors.A093440
Number of n X n symmetric binary matrices with each element either the sum mod 2 of its diagonal neighbors or the sum mod 2 of its antidiagonal neighbors.
- Lexicographically earliest sequence of primes such that a(n) - 1 == 0 (mod a(n - 1) - 1) where a(n) - 1 is a squarefree number; a(1) = 3.A093441
Lexicographically earliest sequence of primes such that a(n) - 1 == 0 (mod a(n - 1) - 1) where a(n) - 1 is a squarefree number; a(1) = 3.
- a(n) = (A093441(n+1)-1)/(A093441(n)-1).A093442
a(n) = (A093441(n+1)-1)/(A093441(n)-1).
- Decimal expansion of (Pi*e)^(1/3).A093443
Decimal expansion of (Pi*e)^(1/3).
- Decimal expansion of (Pi*e)^(1/4).A093444
Decimal expansion of (Pi*e)^(1/4).
- The triangular triangle.A093445
The triangular triangle.
- Largest member of the n-th row of the triangular triangle (A093445).A093446
Largest member of the n-th row of the triangular triangle (A093445).
- Triangle a(n,k) read by rows n which contain columns k=1,2,..,n, where each entry is the product of numbers (k-1)*n-T(k-2)+1 through k*n-T(k-1).A093447
Triangle a(n,k) read by rows n which contain columns k=1,2,..,n, where each entry is the product of numbers (k-1)*n-T(k-2)+1 through k*n-T(k-1).
- Rows sums of the triangle A093447.A093448
Rows sums of the triangle A093447.
- Least number with n distinct prime divisors arising as the product of two or more consecutive integers.A093449
Least number with n distinct prime divisors arising as the product of two or more consecutive integers.
- Number of consecutive integers whose product = A093449(n).A093450
Number of consecutive integers whose product = A093449(n).
- Number of distinct prime divisors of Product_{k=1+(n-1)n/2..n(n+1)/2} k (i.e., of 1, 2*3, 4*5*6, 7*8*9*10, ...).A093451
Number of distinct prime divisors of Product_{k=1+(n-1)n/2..n(n+1)/2} k (i.e., of 1, 2*3, 4*5*6, 7*8*9*10, ...).
- Duplicate of A082103.A093452
Duplicate of A082103.
- 1/1, 2*3/lcm(2,3), 4*5*6/lcm(4,5,6), 7*8*9*10/lcm(7,8,9,10), ...A093453
1/1, 2*3/lcm(2,3), 4*5*6/lcm(4,5,6), 7*8*9*10/lcm(7,8,9,10), ...
- a(n) = floor((LCM of next n numbers)/n!).A093454
a(n) = floor((LCM of next n numbers)/n!).
- a(n) = floor(A093456(n+1)/A093456(n)).A093455
a(n) = floor(A093456(n+1)/A093456(n)).
- Product of composite numbers among next n numbers.A093456
Product of composite numbers among next n numbers.
- Product of primes in the range [T(n-1) + 1, T(n - 1) + n], where T(n) is the n-th triangular number.A093457
Product of primes in the range [T(n-1) + 1, T(n - 1) + n], where T(n) is the n-th triangular number.
- Partial products of A073846.A093458
Partial products of A073846.
- Terms of A093458 which are factorials.A093459
Terms of A093458 which are factorials.
- a(n) = 2n^(n-1) - 1.A093460
a(n) = 2n^(n-1) - 1.