Sequences
392,541 sequences
- a(n) = Sum_{k = 1..10^n} number of primes (counted with multiplicity) dividing k (A001222).A071811
a(n) = Sum_{k = 1..10^n} number of primes (counted with multiplicity) dividing k (A001222).
- Continued fraction expansion of a constant x where each term is determined by a(n) = floor(1/frac(n*x)), where x=0.283151006074509519...A071812
Continued fraction expansion of a constant x where each term is determined by a(n) = floor(1/frac(n*x)), where x=0.283151006074509519...
- Least m such that reverse(sigma(m)) = sigma(m+n).A071813
Least m such that reverse(sigma(m)) = sigma(m+n).
- Numbers k such that the number of 1's in the binary representation of k equals bigomega(k), the number of prime divisors of k (counted with multiplicity).A071814
Numbers k such that the number of 1's in the binary representation of k equals bigomega(k), the number of prime divisors of k (counted with multiplicity).
- Decimal expansion of Sum_{k>=0} d(k!)/k! where d is the number of divisors function.A071815
Decimal expansion of Sum_{k>=0} d(k!)/k! where d is the number of divisors function.
- Number of ordered solutions to x+y+z = u+v+w, 0 <= x, y, z, u, v, w < n.A071816
Number of ordered solutions to x+y+z = u+v+w, 0 <= x, y, z, u, v, w < n.
- Number of 3-digit numbers whose digits add up to n.A071817
Number of 3-digit numbers whose digits add up to n.
- Triangle of T(n,k) where T(n,k)/(n-1)! is probability of player k out of n players winning a game of "Elimination": rules are that player 1 chooses one of the others at random to be eliminated, then player 2 (or 3 if player 2 has been eliminated) chooses somebody else at random from the survivors to be eliminated next, then the next surviving player chooses and so on round the circle until all but one have been eliminated.A071818
Triangle of T(n,k) where T(n,k)/(n-1)! is probability of player k out of n players winning a game of "Elimination": rules are that player 1 chooses one of the others at random to be eliminated, then player 2 (or 3 if player 2 has been eliminated) chooses somebody else at random from the survivors to be eliminated next, then the next surviving player chooses and so on round the circle until all but one have been eliminated.
- a(n) is the difference between the two smallest positive integers that you cannot obtain using the integers {1,2,...,n} at most once and the four operators +, -, *, /.A071819
a(n) is the difference between the two smallest positive integers that you cannot obtain using the integers {1,2,...,n} at most once and the four operators +, -, *, /.
- Kolakoski-(2,3) sequence: a(n) is length of n-th run.A071820
Kolakoski-(2,3) sequence: a(n) is length of n-th run.
- Numbers whose largest prime factor is of the form 4k+1.A071821
Numbers whose largest prime factor is of the form 4k+1.
- Numbers whose largest prime factor is of the form 4k+3.A071822
Numbers whose largest prime factor is of the form 4k+3.
- Number of numbers x <= n with largest prime factor of the form 4k+3.A071823
Number of numbers x <= n with largest prime factor of the form 4k+3.
- Number of integers <= n whose largest prime factor is of the form 4*k+1.A071824
Number of integers <= n whose largest prime factor is of the form 4*k+1.
- a(n) = (number of x with largest prime factor of the form 4k+3 less than or equal to n) minus (number of x with largest prime factor of the form 4k+1 less than or equal to n).A071825
a(n) = (number of x with largest prime factor of the form 4k+3 less than or equal to n) minus (number of x with largest prime factor of the form 4k+1 less than or equal to n).
- Concatenate first n terms of A007770.A071826
Concatenate first n terms of A007770.
- Concatenate first n terms of A007770 in reverse order.A071827
Concatenate first n terms of A007770 in reverse order.
- Primes of the form Sum_{i=1..k} (-1)^(k-i)*i!.A071828
Primes of the form Sum_{i=1..k} (-1)^(k-i)*i!.
- Smallest s > 0 such that Lpf(n) = Lpf(n+s) where Lpf(x) denotes the largest prime factor in x factorization.A071829
Smallest s > 0 such that Lpf(n) = Lpf(n+s) where Lpf(x) denotes the largest prime factor in x factorization.
- Smallest k > n such that Lpf(n) = Lpf(k) where Lpf(x) denotes the largest prime factor in x factorization.A071830
Smallest k > n such that Lpf(n) = Lpf(k) where Lpf(x) denotes the largest prime factor in x factorization.
- Frequency ratios for notes of C-major scale starting at c = 1 (numerators).A071831
Frequency ratios for notes of C-major scale starting at c = 1 (numerators).
- Frequency ratios for notes of C-major scale starting at c = 1 (denominators).A071832
Frequency ratios for notes of C-major scale starting at c = 1 (denominators).
- Frequency ratios for notes of C-major scale starting at c = 24 and using Ptolemy's intense diatonic scale.A071833
Frequency ratios for notes of C-major scale starting at c = 24 and using Ptolemy's intense diatonic scale.
- Numbers k > 1 such that k and sigma(k) have the same largest prime factor.A071834
Numbers k > 1 such that k and sigma(k) have the same largest prime factor.
- Numbers k such that the largest prime factor of k is equal to floor(sqrt(k)).A071835
Numbers k such that the largest prime factor of k is equal to floor(sqrt(k)).
- Numbers k such that the largest prime factor of k = prime(tau(k)).A071836
Numbers k such that the largest prime factor of k = prime(tau(k)).
- Numbers k with the property that in the prime factorization of k all prime exponents are prime, their sum is also prime and equals the sum of distinct prime factors of k.A071837
Numbers k with the property that in the prime factorization of k all prime exponents are prime, their sum is also prime and equals the sum of distinct prime factors of k.
- a(n) = Pi(8,3)(n) + Pi(8,5)(n) - Pi(8,1)(n) - Pi(8,7)(n) where Pi(a,b)(x) denotes the number of primes in the arithmetic progression a*k + b less than or equal to x.A071838
a(n) = Pi(8,3)(n) + Pi(8,5)(n) - Pi(8,1)(n) - Pi(8,7)(n) where Pi(a,b)(x) denotes the number of primes in the arithmetic progression a*k + b less than or equal to x.
- Number of primes == 1 mod 8 <= n.A071839
Number of primes == 1 mod 8 <= n.
- Number of primes == 3 mod 8 <= n.A071840
Number of primes == 3 mod 8 <= n.
- Number of primes == 5 mod 8 <= n.A071841
Number of primes == 5 mod 8 <= n.
- Number of primes == 7 mod 8 <= n.A071842
Number of primes == 7 mod 8 <= n.
- Gives an LCD representation of n.A071843
Gives an LCD representation of n.
- Numbers k such that reverse(gpf(k)) = gpf(k+1), where gpf(n) = A006530(n); a(1)=1.A071844
Numbers k such that reverse(gpf(k)) = gpf(k+1), where gpf(n) = A006530(n); a(1)=1.
- Primes p such that the number of ones in the binary representation of p^p is prime.A071845
Primes p such that the number of ones in the binary representation of p^p is prime.
- phi(n) + phi(reverse(n)) = sigma(n).A071846
phi(n) + phi(reverse(n)) = sigma(n).
- Numbers n such that sigma(n) - sigma(reverse(n)) = phi(n).A071847
Numbers n such that sigma(n) - sigma(reverse(n)) = phi(n).
- a(n) = smallest positive integer that cannot be obtained using the number n at most n times and the operations +, -, *, /, where intermediate subexpressions must be integers.A071848
a(n) = smallest positive integer that cannot be obtained using the number n at most n times and the operations +, -, *, /, where intermediate subexpressions must be integers.
- Numbers k such that A245788(k) > prime(k).A071849
Numbers k such that A245788(k) > prime(k).
- Smallest k > n such that n divides prime(k) - prime(n).A071850
Smallest k > n such that n divides prime(k) - prime(n).
- The limit of a continued fraction.A071851
The limit of a continued fraction.
- Smallest k such that 2^k + 1 has exactly n distinct prime factors.A071852
Smallest k such that 2^k + 1 has exactly n distinct prime factors.
- Numbers n such that for any x, C(2x,x) never has n distinct prime factors.A071853
Numbers n such that for any x, C(2x,x) never has n distinct prime factors.
- a(n) = (number of distinct prime factors in C(2n,n)) - pi(n).A071854
a(n) = (number of distinct prime factors in C(2n,n)) - pi(n).
- Numbers n such that A067434(n) = A000720(n) + A000005(n).A071855
Numbers n such that A067434(n) = A000720(n) + A000005(n).
- Factorial expansion of sqrt(2ln(2)) : sqrt(2ln(2)) = sum( n>=1, a(n)/n! ).A071856
Factorial expansion of sqrt(2ln(2)) : sqrt(2ln(2)) = sum( n>=1, a(n)/n! ).
- Engel expansion of sqrt(2*log(2)).A071857
Engel expansion of sqrt(2*log(2)).
- (Number of 1's in binary expansion of n) mod 3.A071858
(Number of 1's in binary expansion of n) mod 3.
- Determinant of M_n where M_n is the n X n matrix m_(i,j) = A030300(i+j).A071859
Determinant of M_n where M_n is the n X n matrix m_(i,j) = A030300(i+j).
- Number of k 1<=k<=n such that sigma(k) is odd.A071860
Number of k 1<=k<=n such that sigma(k) is odd.