Sequences
392,541 sequences
- Coefficients of 6-point function in dimension 6.A076911
Coefficients of 6-point function in dimension 6.
- Number of degree-n rational curves on a general quintic threefold.A076912
Number of degree-n rational curves on a general quintic threefold.
- Coefficients of 3-point function in dimension 4.A076913
Coefficients of 3-point function in dimension 4.
- Coefficients of 3-point function in dimension 5.A076914
Coefficients of 3-point function in dimension 5.
- Coefficients of 3-point function in dimension 5 Y^1_2.A076915
Coefficients of 3-point function in dimension 5 Y^1_2.
- Coefficients of 3-point function in dimension 6.A076916
Coefficients of 3-point function in dimension 6.
- Coefficients of 3-point function in dimension 6.A076917
Coefficients of 3-point function in dimension 6.
- a(1) = 1, a(n+1) = A076271(n+1) divided by the highest common factor of A076271(n) and A076271(n+1).A076918
a(1) = 1, a(n+1) = A076271(n+1) divided by the highest common factor of A076271(n) and A076271(n+1).
- a(1) = 1, a(2) = 2, then a(n+1) is the smallest number such that the highest common factor of a(n) and a(n+1) is different from that of a(n) and a(n-1) and is more than 1.A076919
a(1) = 1, a(2) = 2, then a(n+1) is the smallest number such that the highest common factor of a(n) and a(n+1) is different from that of a(n) and a(n-1) and is more than 1.
- Highest common factor of a pair of successive terms of A076919.A076920
Highest common factor of a pair of successive terms of A076919.
- Smallest number such that the highest common factor of pair of successive terms follows the pattern 1, 1, 2, 2, 3, 3, 4, 4, ..., i.e., b(2n-1) = b(2n) = n given by A004526.A076921
Smallest number such that the highest common factor of pair of successive terms follows the pattern 1, 1, 2, 2, 3, 3, 4, 4, ..., i.e., b(2n-1) = b(2n) = n given by A004526.
- Smallest number greater than the previous term such that the highest common factor of successive pairs follows the pattern 1, 2, 2, 3, 3, 3, 4, 4, 4, 4, 5, 5, 5, 5, 5, 6, 6, 6, 6, 6, 6, ... (n repeated n times, A002024).A076922
Smallest number greater than the previous term such that the highest common factor of successive pairs follows the pattern 1, 2, 2, 3, 3, 3, 4, 4, 4, 4, 5, 5, 5, 5, 5, 6, 6, 6, 6, 6, 6, ... (n repeated n times, A002024).
- Coefficients of 3-point function in dimension 6.A076923
Coefficients of 3-point function in dimension 6.
- Smallest multiple of the n-th prime not containing any of its digits, or 0 if no such number exists.A076924
Smallest multiple of the n-th prime not containing any of its digits, or 0 if no such number exists.
- a(n) = A076924(n) divided by the n-th prime.A076925
a(n) = A076924(n) divided by the n-th prime.
- Smallest multiple of n with n distinct prime divisors.A076926
Smallest multiple of n with n distinct prime divisors.
- a(n) = A076926(n)/n.A076927
a(n) = A076926(n)/n.
- a(1) = 1, a(n+1)= a(n)*(n+1) divided by the largest prime divisor of n+1.A076928
a(1) = 1, a(n+1)= a(n)*(n+1) divided by the largest prime divisor of n+1.
- a(1) = 1, a(n+1)= a(n)*(n+1) divided by the smallest prime divisor of n+1.A076929
a(1) = 1, a(n+1)= a(n)*(n+1) divided by the smallest prime divisor of n+1.
- Smallest k such that n*k is an n-th power.A076930
Smallest k such that n*k is an n-th power.
- Smallest k such that n*k has n divisors.A076931
Smallest k such that n*k has n divisors.
- Largest k such that n*k has n divisors, or 0 if there are no possibilities for k or infinitely many.A076932
Largest k such that n*k has n divisors, or 0 if there are no possibilities for k or infinitely many.
- Final number obtained when n is divided by its divisors starting from the smallest one in increasing order until one no longer gets an integer.A076933
Final number obtained when n is divided by its divisors starting from the smallest one in increasing order until one no longer gets an integer.
- Smallest integer of the form n/k!.A076934
Smallest integer of the form n/k!.
- a(1)=1, a(n)=n-a(n-1)+a(a(n-1))-a(a(a(n-1)))+a(a(a(a(n-1))))-a(a(a(a(a(n-1))))).A076935
a(1)=1, a(n)=n-a(n-1)+a(a(n-1))-a(a(a(n-1)))+a(a(a(a(n-1))))-a(a(a(a(a(n-1))))).
- a(1) = 1; then the smallest number different from its predecessor such that the n-th partial product is an n-th power.A076936
a(1) = 1; then the smallest number different from its predecessor such that the n-th partial product is an n-th power.
- Duplicate of A014682.A076937
Duplicate of A014682.
- Duplicate of A004526.A076938
Duplicate of A004526.
- Duplicate of A016116.A076939
Duplicate of A016116.
- Define a mapping for a reduced rational number p/q by f(p/q) = 1 followed by p zeros followed by a 1 followed by q zeros.A076940
Define a mapping for a reduced rational number p/q by f(p/q) = 1 followed by p zeros followed by a 1 followed by q zeros.
- a(n) = 2^A066657(n) * 3^A066658(n).A076941
a(n) = 2^A066657(n) * 3^A066658(n).
- Smallest k > 0 such that n*k+1 is a square.A076942
Smallest k > 0 such that n*k+1 is a square.
- Smallest k > 0 such that n*k + 1 is an n-th power.A076943
Smallest k > 0 such that n*k + 1 is an n-th power.
- Least number such that n*k+1 is an n-th power.A076944
Least number such that n*k+1 is an n-th power.
- Duplicate of A074792.A076945
Duplicate of A074792.
- Smallest k such that n*(n+1)*(n+2)...*(n+k) >= n^n.A076946
Smallest k such that n*(n+1)*(n+2)...*(n+k) >= n^n.
- Smallest k > 0 such that nk+1 is a cube.A076947
Smallest k > 0 such that nk+1 is a cube.
- Smallest k such that nk-1 is a square, or 0 if no such number exists.A076948
Smallest k such that nk-1 is a square, or 0 if no such number exists.
- Decimal expansion of c, the constant such that lim n -> infinity A003095(n)/c^(2^n) = 1.A076949
Decimal expansion of c, the constant such that lim n -> infinity A003095(n)/c^(2^n) = 1.
- Smallest k such that nk-1 is a cube.A076950
Smallest k such that nk-1 is a cube.
- Smallest k > 0 such that nk-1 is an n-th power, or 0 if no such number exists.A076951
Smallest k > 0 such that nk-1 is an n-th power, or 0 if no such number exists.
- n-th power associated with A076951, or 0 if no such number exists.A076952
n-th power associated with A076951, or 0 if no such number exists.
- Array T(m,n) = phi(mn)-phi(m)phi(n) (m,n >= 1), read by antidiagonals.A076953
Array T(m,n) = phi(mn)-phi(m)phi(n) (m,n >= 1), read by antidiagonals.
- a(n) = Product_{i=1..n} prime(i)^i.A076954
a(n) = Product_{i=1..n} prime(i)^i.
- Product_{i=1..n} i^prime(i).A076955
Product_{i=1..n} i^prime(i).
- Smallest k^2 such that there are exactly n primes between k^2 and (k+1)^2.A076956
Smallest k^2 such that there are exactly n primes between k^2 and (k+1)^2.
- Smallest k such that there are exactly n primes strictly between k^2 and (k+1)^2.A076957
Smallest k such that there are exactly n primes strictly between k^2 and (k+1)^2.
- Number of primes p with 2^n < p < 3^n.A076958
Number of primes p with 2^n < p < 3^n.
- Number of primes between 3^n and 4^n.A076959
Number of primes between 3^n and 4^n.
- a(n) is the number of primes between n! and (2n)!.A076960
a(n) is the number of primes between n! and (2n)!.