Sequences
392,541 sequences
- a(1) = 1, a(n) = smallest number > a(n-1) such that concatenation a(k) a(n) is prime for all k = 1 to n-1. Stop if no such number exists.A075611
a(1) = 1, a(n) = smallest number > a(n-1) such that concatenation a(k) a(n) is prime for all k = 1 to n-1. Stop if no such number exists.
- a(1) = 1, a(n) = smallest prime number not already used such that concatenation of a(k) and a(n) is composite for all k = 1 to n-1.A075612
a(1) = 1, a(n) = smallest prime number not already used such that concatenation of a(k) and a(n) is composite for all k = 1 to n-1.
- Triangular array read by rows, giving coefficients of P(n,X) = Product_{i=1..2n+1} (X - 1/cos(Pi*k/(2n+1))), a polynomial with integer coefficients.A075613
Triangular array read by rows, giving coefficients of P(n,X) = Product_{i=1..2n+1} (X - 1/cos(Pi*k/(2n+1))), a polynomial with integer coefficients.
- Let P(k,X) = 4^k*Product_{i=1..k} (X - cos(Pi*i/k)) (which is a polynomial with integer coefficients). Sequence gives maximum absolute values of coefficients of P(n,X).A075614
Let P(k,X) = 4^k*Product_{i=1..k} (X - cos(Pi*i/k)) (which is a polynomial with integer coefficients). Sequence gives maximum absolute values of coefficients of P(n,X).
- Let P(k,X) = Product_{i=1..2*k} (X-1/cos(Pi*(2*i-1)/(4*k)) ) which is a polynomial with integer coefficients. Sequence gives array of coefficients for P(k,X).A075615
Let P(k,X) = Product_{i=1..2*k} (X-1/cos(Pi*(2*i-1)/(4*k)) ) which is a polynomial with integer coefficients. Sequence gives array of coefficients for P(k,X).
- Rearrangement of natural numbers so that starting with a(n) the concatenation of n numbers gives a prime.A075616
Rearrangement of natural numbers so that starting with a(n) the concatenation of n numbers gives a prime.
- Rearrangement of natural numbers so that starting with a(n) the concatenation of n numbers gives a composite number.A075617
Rearrangement of natural numbers so that starting with a(n) the concatenation of n numbers gives a composite number.
- Rearrangement of natural numbers so that starting with a(n) the concatenation of n numbers is divisible by n. Choose the smallest number that has not already appeared if there is a choice.A075618
Rearrangement of natural numbers so that starting with a(n) the concatenation of n numbers is divisible by n. Choose the smallest number that has not already appeared if there is a choice.
- Concatenation of n numbers mentioned in A075618, divided by n.A075619
Concatenation of n numbers mentioned in A075618, divided by n.
- Primes mentioned in A075616.A075620
Primes mentioned in A075616.
- Group the natural numbers so that the n-th group contains n numbers whose concatenation is divisible by n: (1), (2, 4), (3, 5, 7), (6, 8, 9, 12), (10, 11, 13, 14, 15), (16, 17, 18, 19, 20, 24), ... Sequence gives numbers formed by the concatenation.A075621
Group the natural numbers so that the n-th group contains n numbers whose concatenation is divisible by n: (1), (2, 4), (3, 5, 7), (6, 8, 9, 12), (10, 11, 13, 14, 15), (16, 17, 18, 19, 20, 24), ... Sequence gives numbers formed by the concatenation.
- Concatenation of n-th group in A075621 divided by n.A075622
Concatenation of n-th group in A075621 divided by n.
- Initial terms of groups in A075621.A075623
Initial terms of groups in A075621.
- Final terms of groups in A075621.A075624
Final terms of groups in A075621.
- Sums of terms of groups in A075621.A075625
Sums of terms of groups in A075621.
- a(1) = 1, then group the natural numbers so that the n-th group contains n numbers relatively prime to n whose sum is divisible by n.A075626
a(1) = 1, then group the natural numbers so that the n-th group contains n numbers relatively prime to n whose sum is divisible by n.
- Initial terms of groups in A075626.A075627
Initial terms of groups in A075626.
- Final terms of groups in A075626.A075628
Final terms of groups in A075626.
- Sums of terms of groups in A075626.A075629
Sums of terms of groups in A075626.
- (1/n) times sum of terms of n-th group in A075626.A075630
(1/n) times sum of terms of n-th group in A075626.
- Group the natural numbers so that the n-th group contains smallest set of consecutive numbers whose sum is a multiple of the sum for the previous group: (1), (2), (3, 4, 5), (6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18), (19, 20, ... Sequence gives sums of terms of the groups.A075631
Group the natural numbers so that the n-th group contains smallest set of consecutive numbers whose sum is a multiple of the sum for the previous group: (1), (2), (3, 4, 5), (6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18), (19, 20, ... Sequence gives sums of terms of the groups.
- a(1) = 1, then {sum of terms of the n-th group in A075631}/{sum of (n-1)-th group}.A075632
a(1) = 1, then {sum of terms of the n-th group in A075631}/{sum of (n-1)-th group}.
- Initial terms of groups in A075631.A075633
Initial terms of groups in A075631.
- Final terms of groups in A075631.A075634
Final terms of groups in A075631.
- a(1) = 1 and then group the composite numbers so that the n-th group contains n numbers with a prime sum: (1), (4, 9), (6, 8, 15), (10, 12, 14, 25), (16, 18, 20, 21, 22), ...A075635
a(1) = 1 and then group the composite numbers so that the n-th group contains n numbers with a prime sum: (1), (4, 9), (6, 8, 15), (10, 12, 14, 25), (16, 18, 20, 21, 22), ...
- Sums of groups in A075635.A075636
Sums of groups in A075635.
- Initial terms of groups in A075635.A075637
Initial terms of groups in A075635.
- Final terms of groups in A075635.A075638
Final terms of groups in A075635.
- a(1) = 1 and then group the prime numbers so that the n-th group contains n numbers with a composite sum: (1), (2, 7), (3, 5, 13), (11, 17, 19, 23), (29, 31, 37, 41, 47), (43, 53, 59, 61, 67, 71), ...A075639
a(1) = 1 and then group the prime numbers so that the n-th group contains n numbers with a composite sum: (1), (2, 7), (3, 5, 13), (11, 17, 19, 23), (29, 31, 37, 41, 47), (43, 53, 59, 61, 67, 71), ...
- Sums of groups in A075639.A075640
Sums of groups in A075639.
- Initial terms of groups in A075639.A075641
Initial terms of groups in A075639.
- Final terms of groups in A075639.A075642
Final terms of groups in A075639.
- Group the natural numbers so that the n-th group contains n numbers one each of a multiple of numbers from 1 to n so that the group sum is a multiple of (n+1): (2), (1, 8), (3, 4, 9), (5, 6, 12, 32), (7, 10, 15, 16, 30), (11, 14, 18, 20, 25, 24), ... Sequence gives initial terms of groups.A075643
Group the natural numbers so that the n-th group contains n numbers one each of a multiple of numbers from 1 to n so that the group sum is a multiple of (n+1): (2), (1, 8), (3, 4, 9), (5, 6, 12, 32), (7, 10, 15, 16, 30), (11, 14, 18, 20, 25, 24), ... Sequence gives initial terms of groups.
- Final terms of groups in A075643.A075644
Final terms of groups in A075643.
- Sums of groups in A075643.A075645
Sums of groups in A075643.
- (Sum of n-th group in A075643)/(n+1).A075646
(Sum of n-th group in A075643)/(n+1).
- List of groups in A075643.A075647
List of groups in A075643.
- Left side of the triangle A075652.A075648
Left side of the triangle A075652.
- Right side of the triangle A075652.A075649
Right side of the triangle A075652.
- Row sums of A075652.A075650
Row sums of A075652.
- Row average values of A075652.A075651
Row average values of A075652.
- Triangle read by rows in which the n-th row is an arithmetic progression of n terms with a common difference of n, and the first term is chosen the lowest possible so that no number appears twice.A075652
Triangle read by rows in which the n-th row is an arithmetic progression of n terms with a common difference of n, and the first term is chosen the lowest possible so that no number appears twice.
- a(n) = n + sopf(n), where sopf is the sum of the distinct prime factors of n (A008472).A075653
a(n) = n + sopf(n), where sopf is the sum of the distinct prime factors of n (A008472).
- Numbers n such that n + sum of prime factors of n = (n+1) + sum of prime factors of (n+1).A075654
Numbers n such that n + sum of prime factors of n = (n+1) + sum of prime factors of (n+1).
- Numbers n such that n + product of prime factors of n = (n+1) + product of prime factors of (n+1).A075655
Numbers n such that n + product of prime factors of n = (n+1) + product of prime factors of (n+1).
- n + product of prime factors of n.A075656
n + product of prime factors of n.
- Numbers n such that sum of digits (A007953) is a divisor of sum of prime divisors (A008472).A075657
Numbers n such that sum of digits (A007953) is a divisor of sum of prime divisors (A008472).
- Numbers k such that the sum of prime divisors of k (A008472) is composite.A075658
Numbers k such that the sum of prime divisors of k (A008472) is composite.
- Sum of prime divisors (A008472) is a power of an integer with exponent greater than 1.A075659
Sum of prime divisors (A008472) is a power of an integer with exponent greater than 1.
- Let f(n) = abs(lpd(n)-gpf(n)), where lpd(n) is the largest proper divisor of n and gpf(n) is the greatest prime factor of n. Sequence gives number of iterations for f(n) to reach zero.A075660
Let f(n) = abs(lpd(n)-gpf(n)), where lpd(n) is the largest proper divisor of n and gpf(n) is the greatest prime factor of n. Sequence gives number of iterations for f(n) to reach zero.