Sequences
392,541 sequences
- Smallest multiple of n with prime(n) divisors, or 0 if no such number exists.A076961
Smallest multiple of n with prime(n) divisors, or 0 if no such number exists.
- Smallest multiple of prime(n) with n divisors, or 0 if no such number exists.A076962
Smallest multiple of prime(n) with n divisors, or 0 if no such number exists.
- Lexicographically earliest increasing sequence of relatively prime numbers with nondecreasing number of divisors. a(0) = 1, tau(a(n+1)) >= tau(a(n)) and GCD(a(n),a(n+1)) = 1.A076963
Lexicographically earliest increasing sequence of relatively prime numbers with nondecreasing number of divisors. a(0) = 1, tau(a(n+1)) >= tau(a(n)) and GCD(a(n),a(n+1)) = 1.
- a(1) = 3, then a(n) = smallest multiple of the previous term with as many divisors.A076964
a(1) = 3, then a(n) = smallest multiple of the previous term with as many divisors.
- a(1) = 2; thereafter a(n) is the smallest number coprime to a(n-1) and having a(n-1) divisors.A076965
a(1) = 2; thereafter a(n) is the smallest number coprime to a(n-1) and having a(n-1) divisors.
- Perfect powers (index > 1) whose digits can be arranged in ascending order or as a substring of 123456789012345678901234567890123...A076966
Perfect powers (index > 1) whose digits can be arranged in ascending order or as a substring of 123456789012345678901234567890123...
- a(1) = 1, a(n+1) is the smallest square greater than the n-th partial sum.A076967
a(1) = 1, a(n+1) is the smallest square greater than the n-th partial sum.
- a(n) = sqrt(A076967(n)).A076968
a(n) = sqrt(A076967(n)).
- a(1) = 1, a(n+1)= smallest cube greater than the n-th partial sum.A076969
a(1) = 1, a(n+1)= smallest cube greater than the n-th partial sum.
- a(n) = A076969(n)^(1/3).A076970
a(n) = A076969(n)^(1/3).
- a(1) = 1, a(n+1)= smallest triangular number greater than the n-th partial sum.A076971
a(1) = 1, a(n+1)= smallest triangular number greater than the n-th partial sum.
- a(n) = index of the triangular number A076971(n).A076972
a(n) = index of the triangular number A076971(n).
- Starting with 2, largest prime divisor of the sum of all previous terms.A076973
Starting with 2, largest prime divisor of the sum of all previous terms.
- Increasing sequence where each number is unequal to 2 mod all previous numbers.A076974
Increasing sequence where each number is unequal to 2 mod all previous numbers.
- a(1) = 1, a(2n) = smallest composite number > (2n-1)-th partial sum of the sequence itself and a(2n+1) = smallest prime > 2n-th partial sum of the sequence.A076975
a(1) = 1, a(2n) = smallest composite number > (2n-1)-th partial sum of the sequence itself and a(2n+1) = smallest prime > 2n-th partial sum of the sequence.
- Product of the smallest prime divisors of composite numbers between successive primes.A076976
Product of the smallest prime divisors of composite numbers between successive primes.
- Product of the largest prime divisors of composite numbers between successive primes.A076977
Product of the largest prime divisors of composite numbers between successive primes.
- Product of the distinct primes dividing the product of composite numbers between consecutive primes.A076978
Product of the distinct primes dividing the product of composite numbers between consecutive primes.
- Deleting exactly one digit yields a prime.A076979
Deleting exactly one digit yields a prime.
- Leyland numbers: 3, together with numbers expressible as n^k + k^n nontrivially, i.e., n,k > 1 (to avoid n = (n-1)^1 + 1^(n-1)).A076980
Leyland numbers: 3, together with numbers expressible as n^k + k^n nontrivially, i.e., n,k > 1 (to avoid n = (n-1)^1 + 1^(n-1)).
- Smallest k such that n*(n+1)*(n+2)*...*(n+k) is divisible by the product of primes up to n.A076981
Smallest k such that n*(n+1)*(n+2)*...*(n+k) is divisible by the product of primes up to n.
- Number of triangular numbers that divide the n-th triangular number.A076982
Number of triangular numbers that divide the n-th triangular number.
- Smallest triangular number divisible by exactly n triangular numbers.A076983
Smallest triangular number divisible by exactly n triangular numbers.
- Number of Fibonacci numbers that are divisors of the n-th Fibonacci number.A076984
Number of Fibonacci numbers that are divisors of the n-th Fibonacci number.
- Smallest Fibonacci numbers having exactly n Fibonacci divisors.A076985
Smallest Fibonacci numbers having exactly n Fibonacci divisors.
- Smallest squarefree number of the form n*k + 1.A076986
Smallest squarefree number of the form n*k + 1.
- Smallest triangular number of the form n*k + 1 with k>0.A076987
Smallest triangular number of the form n*k + 1 with k>0.
- Smallest Fibonacci number of the form n*k + 1 with k>0.A076988
Smallest Fibonacci number of the form n*k + 1 with k>0.
- Smallest cube of the form n*k + 1 with k>0.A076989
Smallest cube of the form n*k + 1 with k>0.
- a(1) = 1, a(2) = 2; thereafter a(n) = smallest number not occurring earlier such that the sum of three successive terms is prime.A076990
a(1) = 1, a(2) = 2; thereafter a(n) = smallest number not occurring earlier such that the sum of three successive terms is prime.
- a(1) = 1, a(2) = 2, a(n) = smallest positive integer not occurring earlier such that the sum of three successive terms is a square.A076991
a(1) = 1, a(2) = 2, a(n) = smallest positive integer not occurring earlier such that the sum of three successive terms is a square.
- Given a(1), ..., a(n-1), a(n) is minimal such that all terms of the sequence are distinct positive integers and, for all k>=1, the sum of the k terms from a(k) to a(2k-1) is a k-th power.A076992
Given a(1), ..., a(n-1), a(n) is minimal such that all terms of the sequence are distinct positive integers and, for all k>=1, the sum of the k terms from a(k) to a(2k-1) is a k-th power.
- Duplicate of A076698.A076993
Duplicate of A076698.
- a(1) = 2, a(n+1) is the largest squarefree number < 2*a(n).A076994
a(1) = 2, a(n+1) is the largest squarefree number < 2*a(n).
- a(1) = 4, a(n+1) is the largest composite number < 2a(n).A076995
a(1) = 4, a(n+1) is the largest composite number < 2a(n).
- a(1) = 2, a(n+1) is the largest prime <= n*a(n).A076996
a(1) = 2, a(n+1) is the largest prime <= n*a(n).
- a(1) = 1, a(n+1) is the largest square <= n*a(n).A076997
a(1) = 1, a(n+1) is the largest square <= n*a(n).
- Difference between cubefree and squarefree components of n.A076998
Difference between cubefree and squarefree components of n.
- a(1) = 1, a(n+1) is the largest Fibonacci number <= n*a(n).A076999
a(1) = 1, a(n+1) is the largest Fibonacci number <= n*a(n).
- a(n) = Fibonacci index of A076999(n).A077000
a(n) = Fibonacci index of A076999(n).
- a(1) = 1, a(n+1) is the largest squarefree number <= n*a(n).A077001
a(1) = 1, a(n+1) is the largest squarefree number <= n*a(n).
- a(1) = 1, a(n+1) is the largest triangular number <= n*a(n).A077002
a(1) = 1, a(n+1) is the largest triangular number <= n*a(n).
- a(n) = index of triangular number A077002(n).A077003
a(n) = index of triangular number A077002(n).
- Duplicate of A002034.A077004
Duplicate of A002034.
- Smallest k such that prime(n) divides k*prime(n-1) + 1, n > 1.A077005
Smallest k such that prime(n) divides k*prime(n-1) + 1, n > 1.
- Numbers k such that sigma(k)/k >= sigma(m)/m for all m <= k.A077006
Numbers k such that sigma(k)/k >= sigma(m)/m for all m <= k.
- Primes p such that p*q+1 or p*q-1 is divisible by r where q = nextprime(p) and r=nextprime(q).A077007
Primes p such that p*q+1 or p*q-1 is divisible by r where q = nextprime(p) and r=nextprime(q).
- Legendre symbol (-1,p) where p is the n-th prime.A077008
Legendre symbol (-1,p) where p is the n-th prime.
- Jacobi symbol(phi(2n+1),2n+1).A077009
Jacobi symbol(phi(2n+1),2n+1).
- Jacobi symbol(sigma(2n+1),2n+1).A077010
Jacobi symbol(sigma(2n+1),2n+1).