Sequences
392,541 sequences
- a(1) = 1; for n > 1, a(n) is the smallest number m > a(n-1) such that the number of 1's in the binary expansion of m is not already in the sequence.A075311
a(1) = 1; for n > 1, a(n) is the smallest number m > a(n-1) such that the number of 1's in the binary expansion of m is not already in the sequence.
- Products of Wythoff pairs: [n*r]*[n*r^2], where [] is the floor function and r is the golden ratio, (1+sqrt(5))/2.A075312
Products of Wythoff pairs: [n*r]*[n*r^2], where [] is the floor function and r is the golden ratio, (1+sqrt(5))/2.
- Pair the natural numbers such that the n-th pair is (k, k+prime(n)) where k is the smallest number not occurring earlier and prime(n) is the n-th prime. (1, 3), (2, 5), (4, 9), (6, 13), (7, 18), (8, 21), (10, 27), (11, 30), (12, 35), (14, 43), ... This is the sequence of the first member of every pair.A075313
Pair the natural numbers such that the n-th pair is (k, k+prime(n)) where k is the smallest number not occurring earlier and prime(n) is the n-th prime. (1, 3), (2, 5), (4, 9), (6, 13), (7, 18), (8, 21), (10, 27), (11, 30), (12, 35), (14, 43), ... This is the sequence of the first member of every pair.
- Pair the natural numbers such that the n-th pair is (k, k+p(n)) where k is the smallest number not occurring earlier and p(n) is the n-th prime. (1, 3), (2, 5), (4, 9), (6, 13), (7, 18), (8, 21), (10, 27), (11, 30), (12, 35), (14, 43), ... This is the sequence of the second member of every pair.A075314
Pair the natural numbers such that the n-th pair is (k, k+p(n)) where k is the smallest number not occurring earlier and p(n) is the n-th prime. (1, 3), (2, 5), (4, 9), (6, 13), (7, 18), (8, 21), (10, 27), (11, 30), (12, 35), (14, 43), ... This is the sequence of the second member of every pair.
- Pair the natural numbers such that the n-th pair is (k, k+p(n)) where k is the smallest number not occurring earlier and p(n) is the n-th prime. (1, 3), (2, 5), (4, 9), (6, 13), (7, 18), (8, 21), (10, 27), (11, 30), (12, 35), (14, 43), ... This is the sequence of the sum of the members of every pair.A075315
Pair the natural numbers such that the n-th pair is (k, k+p(n)) where k is the smallest number not occurring earlier and p(n) is the n-th prime. (1, 3), (2, 5), (4, 9), (6, 13), (7, 18), (8, 21), (10, 27), (11, 30), (12, 35), (14, 43), ... This is the sequence of the sum of the members of every pair.
- Pair the natural numbers such that the n-th pair is (k, k+p(n)) where k is the smallest number not occurring earlier and p(n) is the n-th prime. (1, 3), (2, 5), (4, 9), (6, 13), (7, 18), (8, 21), (10, 27), (11, 30), (12, 35), (14, 43), ... This is the sequence of the product of the members of every pair.A075316
Pair the natural numbers such that the n-th pair is (k, k+p(n)) where k is the smallest number not occurring earlier and p(n) is the n-th prime. (1, 3), (2, 5), (4, 9), (6, 13), (7, 18), (8, 21), (10, 27), (11, 30), (12, 35), (14, 43), ... This is the sequence of the product of the members of every pair.
- Pair the odd numbers such that the k-th pair is (r, r+2k) where r is the smallest odd number not included earlier: (1,3),(5,9),(7,13),(11,19),(15,25),(17,29),(21,35),(23,39),(27,45),... This is the sequence of the first member of pairs.A075317
Pair the odd numbers such that the k-th pair is (r, r+2k) where r is the smallest odd number not included earlier: (1,3),(5,9),(7,13),(11,19),(15,25),(17,29),(21,35),(23,39),(27,45),... This is the sequence of the first member of pairs.
- Pair the odd numbers such that the k-th pair is (r, r+2k) where r is the smallest odd number not included earlier: (1,3),(5,9),(7,13),(11,19),(15,25),(17,29),(21,35),(23,39),(27,45),... This is the sequence of the second member of pairs.A075318
Pair the odd numbers such that the k-th pair is (r, r+2k) where r is the smallest odd number not included earlier: (1,3),(5,9),(7,13),(11,19),(15,25),(17,29),(21,35),(23,39),(27,45),... This is the sequence of the second member of pairs.
- Pair the odd numbers such that the k-th pair is (r, r+2k) where r is the smallest odd number not included earlier: (1,3),(5,9),(7,13),(11,19),(15,25),(17,29),(21,35),(23,39),(27,45),... This is the sequence of the sum of the members of pairs.A075319
Pair the odd numbers such that the k-th pair is (r, r+2k) where r is the smallest odd number not included earlier: (1,3),(5,9),(7,13),(11,19),(15,25),(17,29),(21,35),(23,39),(27,45),... This is the sequence of the sum of the members of pairs.
- Pair the odd numbers such that the k-th pair is (r, r+2k) where r is the smallest odd number not included earlier: (1, 3), (5, 9), (7, 13), (11, 19), (15, 25), (17, 29), (21, 35), (23, 39), (27, 45), ... This is the sequence of the product of the members of pairs.A075320
Pair the odd numbers such that the k-th pair is (r, r+2k) where r is the smallest odd number not included earlier: (1, 3), (5, 9), (7, 13), (11, 19), (15, 25), (17, 29), (21, 35), (23, 39), (27, 45), ... This is the sequence of the product of the members of pairs.
- Pair the odd primes so that the n-th pair is (p, p+2n) where p is the smallest prime not included earlier such that p and p+2n are primes and p+2n also does not occur earlier: (3, 5), (7, 11), (13, 19), (23, 31), (37, 47), (17, 29), (53, 67) ... This is the sequence of the first member of every pair.A075321
Pair the odd primes so that the n-th pair is (p, p+2n) where p is the smallest prime not included earlier such that p and p+2n are primes and p+2n also does not occur earlier: (3, 5), (7, 11), (13, 19), (23, 31), (37, 47), (17, 29), (53, 67) ... This is the sequence of the first member of every pair.
- Pair the odd primes so that the k-th pair is (p, p+2n) where p is the smallest prime not included earlier such that p and p+2n are primes and p+2n also does not occur earlier: (3, 5), (7, 11), (13, 19), (23, 31), (37, 47), (17, 29), ... This is the sequence of the second member of every pair.A075322
Pair the odd primes so that the k-th pair is (p, p+2n) where p is the smallest prime not included earlier such that p and p+2n are primes and p+2n also does not occur earlier: (3, 5), (7, 11), (13, 19), (23, 31), (37, 47), (17, 29), ... This is the sequence of the second member of every pair.
- Pair the odd primes so that the n-th pair is (p, p+2n) where p is the smallest prime not included earlier such that p and p+2n are primes and p+2n also does not occur earlier: (3, 5), (7, 11), (13, 19), (23, 31), (37, 47), (17, 29), ... This lists the successive pairs in order.A075323
Pair the odd primes so that the n-th pair is (p, p+2n) where p is the smallest prime not included earlier such that p and p+2n are primes and p+2n also does not occur earlier: (3, 5), (7, 11), (13, 19), (23, 31), (37, 47), (17, 29), ... This lists the successive pairs in order.
- Independent domination number for queens' graph Q(n).A075324
Independent domination number for queens' graph Q(n).
- Pair the natural numbers such that the m-th pair is (r, s) where r, s and s-r are the smallest numbers which have not occurred earlier and also are not equal to the difference of any earlier pair: (1, 3), (4, 9), (6, 13), (8, 18), (11, 23), (14, 29), (16, 33), (19, 39), (21, 43), (24, 49), (26, 53), (28, 58), ... Sequence gives first term of each pair.A075325
Pair the natural numbers such that the m-th pair is (r, s) where r, s and s-r are the smallest numbers which have not occurred earlier and also are not equal to the difference of any earlier pair: (1, 3), (4, 9), (6, 13), (8, 18), (11, 23), (14, 29), (16, 33), (19, 39), (21, 43), (24, 49), (26, 53), (28, 58), ... Sequence gives first term of each pair.
- Anti-Fibonacci numbers: start with a(0) = 0, and extend by the rule that the next term is the sum of the two smallest numbers that are not in the sequence nor were used to form an earlier sum.A075326
Anti-Fibonacci numbers: start with a(0) = 0, and extend by the rule that the next term is the sum of the two smallest numbers that are not in the sequence nor were used to form an earlier sum.
- Sum of n-th pair in A075325.A075327
Sum of n-th pair in A075325.
- Difference between n-th pair in A075325.A075328
Difference between n-th pair in A075325.
- Pair up the natural numbers as (r, s) (say) so that all natural numbers are obtained only once as r, s, s+r or s-r: (1, 3), (5, 11), (7, 15), (9, 19), (12, 25), (14, 31), (18, 38), ... Sequence gives first member of each pair.A075329
Pair up the natural numbers as (r, s) (say) so that all natural numbers are obtained only once as r, s, s+r or s-r: (1, 3), (5, 11), (7, 15), (9, 19), (12, 25), (14, 31), (18, 38), ... Sequence gives first member of each pair.
- Second members of pairs in A075329.A075330
Second members of pairs in A075329.
- Sums of pairs in A075329.A075331
Sums of pairs in A075329.
- Differences of pairs in A075329.A075332
Differences of pairs in A075329.
- Pair up the natural numbers as (r, s) (say) so that all natural numbers are obtained only once as r, s, s+r, s-r or r*s: (2, 3), (4, 11), (8, 17), (10, 22), (13, 27), (16, 34), ... Sequence gives first member of each pair.A075333
Pair up the natural numbers as (r, s) (say) so that all natural numbers are obtained only once as r, s, s+r, s-r or r*s: (2, 3), (4, 11), (8, 17), (10, 22), (13, 27), (16, 34), ... Sequence gives first member of each pair.
- Second members of pairs in A075333.A075334
Second members of pairs in A075333.
- Differences of members of pairs in A075333.A075335
Differences of members of pairs in A075333.
- Sums of members of pairs in A075333.A075336
Sums of members of pairs in A075333.
- Products of members of pairs in A075333.A075337
Products of members of pairs in A075333.
- a(1) = 1, a(2n) = smallest prime obtained by adding a composite number to a(2n-1). a(2n+1) = the smallest composite number obtained by adding a prime to a(2n).A075338
a(1) = 1, a(2n) = smallest prime obtained by adding a composite number to a(2n-1). a(2n+1) = the smallest composite number obtained by adding a prime to a(2n).
- a(1) = 1, a(2n) = smallest composite number obtained by adding a prime to a(2n-1). a(2n+1) = the smallest prime obtained by adding a composite number to a(2n).A075339
a(1) = 1, a(2n) = smallest composite number obtained by adding a prime to a(2n-1). a(2n+1) = the smallest prime obtained by adding a composite number to a(2n).
- a(1) = 1; a(2n) is the smallest prime == 1 mod (a(2n-1)) and a(2n+1) is the smallest composite number == 1 (mod a(2n)).A075340
a(1) = 1; a(2n) is the smallest prime == 1 mod (a(2n-1)) and a(2n+1) is the smallest composite number == 1 (mod a(2n)).
- a(1) = 1, a(2n) is the smallest composite number == 1 mod (a(2n-1)) and a(2n+1) is the smallest prime == 1 (mod a(2n)).A075341
a(1) = 1, a(2n) is the smallest composite number == 1 mod (a(2n-1)) and a(2n+1) is the smallest prime == 1 (mod a(2n)).
- a(1) = 1, a(n+1) is the smallest number such that there are n primes between a(n) and a(n+1) exclusive.A075342
a(1) = 1, a(n+1) is the smallest number such that there are n primes between a(n) and a(n+1) exclusive.
- a(1) = 1, a(n+1) is the smallest number such that there are n composite numbers between a(n) and a(n+1) exclusive.A075343
a(1) = 1, a(n+1) is the smallest number such that there are n composite numbers between a(n) and a(n+1) exclusive.
- Number of primes between consecutive terms of A075343 (excluding endpoints).A075344
Number of primes between consecutive terms of A075343 (excluding endpoints).
- Group the natural numbers such that the n-th group contains n terms and the group sum is the smallest possible prime: (2), (1, 4), (3, 5, 9), (6, 7, 8, 10), (11, 12, 13, 14, 17), (15, 16, 18, 19, 20, 21), ... Sequence gives group sums.A075345
Group the natural numbers such that the n-th group contains n terms and the group sum is the smallest possible prime: (2), (1, 4), (3, 5, 9), (6, 7, 8, 10), (11, 12, 13, 14, 17), (15, 16, 18, 19, 20, 21), ... Sequence gives group sums.
- Initial terms of groups in A075345.A075346
Initial terms of groups in A075345.
- Final terms of groups in A075345.A075347
Final terms of groups in A075345.
- Group the natural numbers such that the n-th group contains n terms and the group sum is the smallest possible prime.A075348
Group the natural numbers such that the n-th group contains n terms and the group sum is the smallest possible prime.
- a(1) = 1; first differences follow the pattern 1,2,2,3,3,3,4,4,4,4,5,5,5,5,5,..., i.e., the next n differences are n.A075349
a(1) = 1; first differences follow the pattern 1,2,2,3,3,3,4,4,4,4,5,5,5,5,5,..., i.e., the next n differences are n.
- 1-1, 2*3-(2+3), 4*5*6-(4+5+6), 7*8*9*10-(7+8+9+10), ...A075350
1-1, 2*3-(2+3), 4*5*6-(4+5+6), 7*8*9*10-(7+8+9+10), ...
- a(n) = floor(2*binomial(n+1,2)!/(binomial(n,2)!*n*(n^2+1))).A075351
a(n) = floor(2*binomial(n+1,2)!/(binomial(n,2)!*n*(n^2+1))).
- Group the natural numbers so that the product of the terms of the n-th group is just >= n!: (1), (2), (3, 4), (5, 6), (7, 8, 9), (10, 11, 12), (13, 14, 15, 16), (17, 18, 19, 20), (21, 22, 23, 24, 25), (26, 27, 28, 29, 30), ... Sequence gives product of numbers in each group.A075352
Group the natural numbers so that the product of the terms of the n-th group is just >= n!: (1), (2), (3, 4), (5, 6), (7, 8, 9), (10, 11, 12), (13, 14, 15, 16), (17, 18, 19, 20), (21, 22, 23, 24, 25), (26, 27, 28, 29, 30), ... Sequence gives product of numbers in each group.
- Initial term of n-th group in A075352.A075353
Initial term of n-th group in A075352.
- Final term of n-th group in A075352.A075354
Final term of n-th group in A075352.
- Number of terms in n-th group in A075352.A075355
Number of terms in n-th group in A075352.
- Sum of terms in n-th group in A075352.A075356
Sum of terms in n-th group in A075352.
- a(n) = smallest k such that (n+1)(n+2)...(n+k) >= n!.A075357
a(n) = smallest k such that (n+1)(n+2)...(n+k) >= n!.
- a(n) = smallest (n+1)(n+2)...(n+k) that is >= n!.A075358
a(n) = smallest (n+1)(n+2)...(n+k) that is >= n!.
- Sum of the digits of the next n numbers.A075359
Sum of the digits of the next n numbers.
- Smallest prime (> n-th prime) with sum of digits = the n-th prime, or 0 if no such prime exists.A075360
Smallest prime (> n-th prime) with sum of digits = the n-th prime, or 0 if no such prime exists.