Sequences
392,541 sequences
- a(n) is the smallest integer k > 1 such that k > n * pi(k), where pi() denotes the prime counting function.A086511
a(n) is the smallest integer k > 1 such that k > n * pi(k), where pi() denotes the prime counting function.
- Rearrangement of natural numbers such that every (2n-1)-th partial sum is prime. Every 2n-th term is the smallest number not included earlier.A086512
Rearrangement of natural numbers such that every (2n-1)-th partial sum is prime. Every 2n-th term is the smallest number not included earlier.
- Primes arising in A086512: a(n)= (2n-1)-th partial sum of A086512.A086513
Primes arising in A086512: a(n)= (2n-1)-th partial sum of A086512.
- Difference between the arithmetic mean of the neighbors of the terms and the term itself follows the pattern 0,1,2,3,4,5,...A086514
Difference between the arithmetic mean of the neighbors of the terms and the term itself follows the pattern 0,1,2,3,4,5,...
- Duplicate of A047241.A086515
Duplicate of A047241.
- Erroneous version of A085641.A086516
Erroneous version of A085641.
- a(1) = 1 and then the smallest odd number not included earlier such that the arithmetic mean of a pair of successive terms is prime.A086517
a(1) = 1 and then the smallest odd number not included earlier such that the arithmetic mean of a pair of successive terms is prime.
- Primes arising as the arithmetic mean of a pair of successive terms of A086517.A086518
Primes arising as the arithmetic mean of a pair of successive terms of A086517.
- a(n) is the least prime not already used such that (a(n)+a(n-1))/2 is prime.A086519
a(n) is the least prime not already used such that (a(n)+a(n-1))/2 is prime.
- Number of integers strictly greater than (n-sqrt(n))/2 and strictly less than (n+sqrt(n))/2.A086520
Number of integers strictly greater than (n-sqrt(n))/2 and strictly less than (n+sqrt(n))/2.
- Number of tandem duplication trees on n duplicated gene segments.A086521
Number of tandem duplication trees on n duplicated gene segments.
- Primes arising as the arithmetic mean of a pair of successive terms of A086519.A086522
Primes arising as the arithmetic mean of a pair of successive terms of A086519.
- Beginning with 5, distinct odd primes such that the arithmetic mean of every pair of successive terms is prime.A086523
Beginning with 5, distinct odd primes such that the arithmetic mean of every pair of successive terms is prime.
- Primes arising as the arithmetic mean of a pair of successive terms of A086523.A086524
Primes arising as the arithmetic mean of a pair of successive terms of A086523.
- a(n) = a(( a(n-2))*(1-mod(n,2))+a(n-1)*(mod(n,2))) + a((n - a(n-2))*(1-mod(n,2))+(n-a(n-1))*(mod(n,2))).A086525
a(n) = a(( a(n-2))*(1-mod(n,2))+a(n-1)*(mod(n,2))) + a((n - a(n-2))*(1-mod(n,2))+(n-a(n-1))*(mod(n,2))).
- Beginning with 2, the smallest even number not included earlier such that the arithmetic mean of a pair of successive terms is a prime.A086526
Beginning with 2, the smallest even number not included earlier such that the arithmetic mean of a pair of successive terms is a prime.
- Primes arising in A055265.A086527
Primes arising in A055265.
- Smallest prime which occurs exactly n times in the sequence A086527.A086528
Smallest prime which occurs exactly n times in the sequence A086527.
- Beginning with 2, distinct even numbers such that the arithmetic mean of successive pairs of terms gives odd primes in their natural order. {a(n) + a(n+1)}/2 = prime(n+1).A086529
Beginning with 2, distinct even numbers such that the arithmetic mean of successive pairs of terms gives odd primes in their natural order. {a(n) + a(n+1)}/2 = prime(n+1).
- Beginning with 1, odd numbers such that the arithmetic mean of successive pairs of terms gives primes in their natural order. {a(n) + a(n+1)}/2 = prime(n).A086530
Beginning with 1, odd numbers such that the arithmetic mean of successive pairs of terms gives primes in their natural order. {a(n) + a(n+1)}/2 = prime(n).
- a(1) = 9; a(n+1) is the least odd composite number not already used such that (a(n+1)+a(n))/2 is prime.A086531
a(1) = 9; a(n+1) is the least odd composite number not already used such that (a(n+1)+a(n))/2 is prime.
- Primes arising in A086531. a(n)= {A086531(n) + A086531(n+1)}/2.A086532
Primes arising in A086531. a(n)= {A086531(n) + A086531(n+1)}/2.
- Numbers in A014092 splittable into a sum of a single number pair (both distinct from 1) having a product that belongs to A086473.A086533
Numbers in A014092 splittable into a sum of a single number pair (both distinct from 1) having a product that belongs to A086473.
- Smallest prime p sandwiched between two numbers that are divisible by n-th powers.A086534
Smallest prime p sandwiched between two numbers that are divisible by n-th powers.
- Product of numbers obtained by adding one to the odd divisors of n and subtracting 1 from the even divisors.A086535
Product of numbers obtained by adding one to the odd divisors of n and subtracting 1 from the even divisors.
- Least common multiple of numbers obtained by adding one to the odd divisors of n and subtracting 1 from the even divisors of n.A086536
Least common multiple of numbers obtained by adding one to the odd divisors of n and subtracting 1 from the even divisors of n.
- Beginning with 1, the smallest number not yet seen such that every partial sum has a distinct prime signature.A086537
Beginning with 1, the smallest number not yet seen such that every partial sum has a distinct prime signature.
- n-th partial sum of A086537.A086538
n-th partial sum of A086537.
- Beginning with 1, a(n) = smallest number > a(n-1) and coprime to the k previous terms, where k = floor(n/2).A086539
Beginning with 1, a(n) = smallest number > a(n-1) and coprime to the k previous terms, where k = floor(n/2).
- Numbers n such that n and n+1 both are members of A074997; i.e., on the one hand n-1 and n+1 have the same prime signature, on the other hand n and n+2 have the same prime signature.A086540
Numbers n such that n and n+1 both are members of A074997; i.e., on the one hand n-1 and n+1 have the same prime signature, on the other hand n and n+2 have the same prime signature.
- a(1) = 1, a(2) = 4; a(n) = smallest square of the form k*a(n-1) + a(n-2), k > 0.A086541
a(1) = 1, a(2) = 4; a(n) = smallest square of the form k*a(n-1) + a(n-2), k > 0.
- a(n) = A086541(n)^(1/2).A086542
a(n) = A086541(n)^(1/2).
- Number of partitions of n with at least one odd part.A086543
Number of partitions of n with at least one odd part.
- Duplicate of A031146.A086544
Duplicate of A031146.
- Smallest k such that n*k+1 is a prime and (n-1)/k is noncomposite, or 0 if no such number exists.A086545
Smallest k such that n*k+1 is a prime and (n-1)/k is noncomposite, or 0 if no such number exists.
- (1/p)*(F(2p)-F(p)) where p runs through the primes and F(k) denotes the k-th Fibonacci number.A086546
(1/p)*(F(2p)-F(p)) where p runs through the primes and F(k) denotes the k-th Fibonacci number.
- Smallest number > n beginning with n and with the prime signature of n.A086547
Smallest number > n beginning with n and with the prime signature of n.
- Duplicate of A083434.A086548
Duplicate of A083434.
- Smallest number not included earlier, beginning with 1 and having the prime signature of n.A086549
Smallest number not included earlier, beginning with 1 and having the prime signature of n.
- Smallest k such that tau(k) - tau(k-1) = n, where tau(k) = number of divisors of k, or 0 if no such number exists.A086550
Smallest k such that tau(k) - tau(k-1) = n, where tau(k) = number of divisors of k, or 0 if no such number exists.
- a(n) = smallest k such that tau(k)= n*tau(k-1) where tau(k) = number of divisors of k, or 0 if no such number exists.A086551
a(n) = smallest k such that tau(k)= n*tau(k-1) where tau(k) = number of divisors of k, or 0 if no such number exists.
- Numbers x such that tau(x)/tau(x-1) is an integer, where tau() is the number of divisors function.A086552
Numbers x such that tau(x)/tau(x-1) is an integer, where tau() is the number of divisors function.
- a(1) = 1, a(n) = smallest number not included earlier such that both a(n) + 1 and a(n)*a(n-1) + 1 are primes.A086553
a(1) = 1, a(n) = smallest number not included earlier such that both a(n) + 1 and a(n)*a(n-1) + 1 are primes.
- a(1) = 1; for n>1, a(n) = smallest number not included earlier such that each P+1 is prime, where P is the product of an (n-1)-set from the previous n terms.A086554
a(1) = 1; for n>1, a(n) = smallest number not included earlier such that each P+1 is prime, where P is the product of an (n-1)-set from the previous n terms.
- E.g.f. satisfies F(x) = 1/2 * (F(-log(1-x)) + x).A086555
E.g.f. satisfies F(x) = 1/2 * (F(-log(1-x)) + x).
- Lexicographically earliest sequence of pairwise coprime numbers such that tau(a(n)) = n, where tau(k) = number of divisors of k.A086556
Lexicographically earliest sequence of pairwise coprime numbers such that tau(a(n)) = n, where tau(k) = number of divisors of k.
- Smallest number not included earlier, beginning with 2 and having prime signature of n.A086557
Smallest number not included earlier, beginning with 2 and having prime signature of n.
- Smallest n-digit number beginning with n and having prime signature of n, or 0 if no such number exists.A086558
Smallest n-digit number beginning with n and having prime signature of n, or 0 if no such number exists.
- a(n) = (smallest n-digit number beginning with n and having prime signature of n)- (smallest n-digit number beginning with n).A086559
a(n) = (smallest n-digit number beginning with n and having prime signature of n)- (smallest n-digit number beginning with n).
- Start of first run of n successive numbers in which i-th number has exactly i distinct prime divisors for i = 1..n.A086560
Start of first run of n successive numbers in which i-th number has exactly i distinct prime divisors for i = 1..n.