Sequences
392,541 sequences
- a(1)=1, a(2k)=2*a(k), a(2k+1)=3*a(k).A073061
a(1)=1, a(2k)=2*a(k), a(2k+1)=3*a(k).
- Take A000040, omit commas: 235711131719232931374143,... select first n-digit prime.A073062
Take A000040, omit commas: 235711131719232931374143,... select first n-digit prime.
- G.f. satisfies: A(x) = exp( Sum_{n>=1} L(n)*A(x^n)*x^n/n ) where L(n) = n-th Lucas number.A073063
G.f. satisfies: A(x) = exp( Sum_{n>=1} L(n)*A(x^n)*x^n/n ) where L(n) = n-th Lucas number.
- Primes with non-distinct digits.A073064
Primes with non-distinct digits.
- a(n) = prime(n) * prime(prime(n)).A073065
a(n) = prime(n) * prime(prime(n)).
- Least k such that n*prime(k) <= k*tau(k).A073066
Least k such that n*prime(k) <= k*tau(k).
- Minimum value of abs(prime(n)-k*tau(k)) for k>0.A073067
Minimum value of abs(prime(n)-k*tau(k)) for k>0.
- Minimum value of abs(n-x*tau(x)) x>0.A073068
Minimum value of abs(n-x*tau(x)) x>0.
- Indices of primes with non-distinct digits.A073069
Indices of primes with non-distinct digits.
- Binary expansion of 1/AGM(1,sqrt(2)).A073070
Binary expansion of 1/AGM(1,sqrt(2)).
- Least k such that k! > prime(1)*prime(2)*...*prime(n) where prime(n) is the n-th prime.A073071
Least k such that k! > prime(1)*prime(2)*...*prime(n) where prime(n) is the n-th prime.
- Minimum value of abs(n^2-x^3) x>0.A073072
Minimum value of abs(n^2-x^3) x>0.
- Numbers m such that the minimal value of abs(2^m - 3^x) > 0 is prime (i.e., m such that A064024(m) is prime).A073073
Numbers m such that the minimal value of abs(2^m - 3^x) > 0 is prime (i.e., m such that A064024(m) is prime).
- Inverse Aronson transform of odious numbers (A000069).A073074
Inverse Aronson transform of odious numbers (A000069).
- Generating function satisfies A(x) = exp(2*A(x)*x + 2*A(x^3)*x^3/3 + 2*A(x^5)*x^5/5 + 2*A(x^7)*x^7/7 +...).A073075
Generating function satisfies A(x) = exp(2*A(x)*x + 2*A(x^3)*x^3/3 + 2*A(x^5)*x^5/5 + 2*A(x^7)*x^7/7 +...).
- Numbers k such that 2*k+1 divides C(2*k,k).A073076
Numbers k such that 2*k+1 divides C(2*k,k).
- Numbers k that divide C(2k,k) and C(4k,2k).A073077
Numbers k that divide C(2k,k) and C(4k,2k).
- Least k such that n divides C(2k,k).A073078
Least k such that n divides C(2k,k).
- Generating function satisfies A(x) = exp(A(x)x + 3A(x^2)x^2/2 + A(x^3)x^3/3 + 3A(x^4)x^4/4 +...).A073079
Generating function satisfies A(x) = exp(A(x)x + 3A(x^2)x^2/2 + A(x^3)x^3/3 + 3A(x^4)x^4/4 +...).
- 3 appears three times, 2*3=6 appears six times, 2*6=12 appears twelve times etc.A073080
3 appears three times, 2*3=6 appears six times, 2*6=12 appears twelve times etc.
- Greatest k such that k! divides sigma(n!).A073081
Greatest k such that k! divides sigma(n!).
- Numbers n such that sum k/d(k) is an integer, where d(k) is the k-th divisor of n (the divisors of n are in increasing order).A073082
Numbers n such that sum k/d(k) is an integer, where d(k) is the k-th divisor of n (the divisors of n are in increasing order).
- Numbers n such that sum k/d(k) is an integer, where d(k) is the k-th divisor of n (the divisors of n are in decreasing order).A073083
Numbers n such that sum k/d(k) is an integer, where d(k) is the k-th divisor of n (the divisors of n are in decreasing order).
- Decimal expansion of -x, where x is the negative solution to the equation 2^x = x^2.A073084
Decimal expansion of -x, where x is the negative solution to the equation 2^x = x^2.
- Numbers n such that 210*n+1 is prime.A073085
Numbers n such that 210*n+1 is prime.
- Floor[concatenation of eight consecutive numbers from n to n+7 divided by 8].A073086
Floor[concatenation of eight consecutive numbers from n to n+7 divided by 8].
- Least k such that sigma(k^k)>=n*k^k.A073087
Least k such that sigma(k^k)>=n*k^k.
- Sum of first n terms of the simple continued fraction of Sum_{k>=0} 1/2^(2^k) (cf. A007400).A073088
Sum of first n terms of the simple continued fraction of Sum_{k>=0} 1/2^(2^k) (cf. A007400).
- a(n) = (1/2)*(4n - 3 - Sum_{k=1..n} A007400(k)).A073089
a(n) = (1/2)*(4n - 3 - Sum_{k=1..n} A007400(k)).
- Number of permutations p from (1,2,3,...,n) to (1,2,3...,n) such that 1/p(1)+2/p(2)+...+n/p(n) is an integer.A073090
Number of permutations p from (1,2,3,...,n) to (1,2,3...,n) such that 1/p(1)+2/p(2)+...+n/p(n) is an integer.
- Number of ways to express n as (x^3+y^3+z^3)/(x+y+z) 1<=x<=y<=z<=n.A073091
Number of ways to express n as (x^3+y^3+z^3)/(x+y+z) 1<=x<=y<=z<=n.
- Number of numbers of the form x^2 + y^2 (0 <= x <= y) less than or equal to n.A073092
Number of numbers of the form x^2 + y^2 (0 <= x <= y) less than or equal to n.
- Number of prime power divisors of n.A073093
Number of prime power divisors of n.
- Final digit of C(2k,k) when not equal to zero.A073094
Final digit of C(2k,k) when not equal to zero.
- Numbers k such that the final nonzero digit of k! is the same as the last digit of binomial(2k,k) (in base 10).A073095
Numbers k such that the final nonzero digit of k! is the same as the last digit of binomial(2k,k) (in base 10).
- Maximal element in continued fraction for s(n) = sum( k>=n,1/2^(2^k) ).A073096
Maximal element in continued fraction for s(n) = sum( k>=n,1/2^(2^k) ).
- Let x(n) denote the number of 4's among the n first elements of the continued fraction for sum k>=0 1/2^(2^k) (A007400), y(n) the number of 6's and z(n) the number of 2's. Then a(n)=x(n)-y(n)-z(n)-1.A073097
Let x(n) denote the number of 4's among the n first elements of the continued fraction for sum k>=0 1/2^(2^k) (A007400), y(n) the number of 6's and z(n) the number of 2's. Then a(n)=x(n)-y(n)-z(n)-1.
- a(1)=2, a(n) is the smallest positive integer such that the continued fraction for 1/a(1)+1/a(2)+....+1/a(n) contains strictly more elements than the continued fraction for 1/a(1)+1/a(2)+....+1/a(n-1).A073098
a(1)=2, a(n) is the smallest positive integer such that the continued fraction for 1/a(1)+1/a(2)+....+1/a(n) contains strictly more elements than the continued fraction for 1/a(1)+1/a(2)+....+1/a(n-1).
- Numerator of b(n) = n * Sum_{k=2^n..2^(n+1)-1} (-1)^k/k.A073099
Numerator of b(n) = n * Sum_{k=2^n..2^(n+1)-1} (-1)^k/k.
- Denominator of b(n) = n * Sum_{k=2^n..2^(n+1)-1} (-1)^k/k.A073100
Denominator of b(n) = n * Sum_{k=2^n..2^(n+1)-1} (-1)^k/k.
- Number of integer solutions (x,y,z) to 4/n = 1/x + 1/y + 1/z satisfying 0 < x < y < z.A073101
Number of integer solutions (x,y,z) to 4/n = 1/x + 1/y + 1/z satisfying 0 < x < y < z.
- Primes of the form 210n + 1.A073102
Primes of the form 210n + 1.
- Number of solutions to x^4 == 1 (mod n).A073103
Number of solutions to x^4 == 1 (mod n).
- Duplicate of A060566.A073104
Duplicate of A060566.
- Least k such that there are n primes among the numbers x*2^n + 1 for 1 <= x <= k.A073105
Least k such that there are n primes among the numbers x*2^n + 1 for 1 <= x <= k.
- Least k such that there are n primes among the numbers 2*n*x + 1 for 1 <= x <= k.A073106
Least k such that there are n primes among the numbers 2*n*x + 1 for 1 <= x <= k.
- Triangle T(n,k) read by rows, where e.g.f. for T(n,k) is exp((1+y)*x)/(1-x).A073107
Triangle T(n,k) read by rows, where e.g.f. for T(n,k) is exp((1+y)*x)/(1-x).
- Least k such that there are n primes among the numbers n^2 + x^2 for 1 <= x <= k.A073108
Least k such that there are n primes among the numbers n^2 + x^2 for 1 <= x <= k.
- a(n) = (Product_{p<=n, p odd prime} p) * Sum_{k=1..n} B(k)*C(2k,k) where B(k) is the k-th Bernoulli number.A073109
a(n) = (Product_{p<=n, p odd prime} p) * Sum_{k=1..n} B(k)*C(2k,k) where B(k) is the k-th Bernoulli number.
- Number of permutations p of (1,2,3,...,n) such that sigma(1+p(1))+sigma(2+p(2))+...+sigma(n+p(n))=2*n^2.A073110
Number of permutations p of (1,2,3,...,n) such that sigma(1+p(1))+sigma(2+p(2))+...+sigma(n+p(n))=2*n^2.