Sequences
392,541 sequences
- Numerator of average of number of steps in Euclidean algorithm for all gcd(m,n) with 0<=m<n.A051011
Numerator of average of number of steps in Euclidean algorithm for all gcd(m,n) with 0<=m<n.
- Denominator of average of number of steps in Euclidean algorithm for all gcd(m,n) with 0 <= m < n.A051012
Denominator of average of number of steps in Euclidean algorithm for all gcd(m,n) with 0 <= m < n.
- Number of nonaveraging subsets on {1,2,...,n}.A051013
Number of nonaveraging subsets on {1,2,...,n}.
- Number of nondividing sets on {1,2,...,n}.A051014
Number of nondividing sets on {1,2,...,n}.
- Zeisel numbers.A051015
Zeisel numbers.
- Numbers k for which r^k-floor(r^k) < 1/2, where r is the real root of x^3-x-1.A051016
Numbers k for which r^k-floor(r^k) < 1/2, where r is the real root of x^3-x-1.
- Numbers k for which r^k-floor(r^k) > 1/2, where r is the real root of x^3-x-1.A051017
Numbers k for which r^k-floor(r^k) > 1/2, where r is the real root of x^3-x-1.
- Numbers that are 2-persistent but not 3-persistent.A051018
Numbers that are 2-persistent but not 3-persistent.
- Numbers that are 3-persistent but not 4-persistent.A051019
Numbers that are 3-persistent but not 4-persistent.
- Numbers that are 4-persistent but not 5-persistent.A051020
Numbers that are 4-persistent but not 5-persistent.
- Decimal expansion of Mills's constant, assuming the Riemann Hypothesis is true.A051021
Decimal expansion of Mills's constant, assuming the Riemann Hypothesis is true.
- Interpolate 0's between each pair of digits of n.A051022
Interpolate 0's between each pair of digits of n.
- Middle column of rule-30 1-D cellular automaton, from a lone 1 cell.A051023
Middle column of rule-30 1-D cellular automaton, from a lone 1 cell.
- Values of n for which pi_{4,3}(p_n) - pi_{4,1}(p_n) = -1, where p_n is the n-th prime and pi_{m,a}(x) is the number of primes <= x which are congruent to a (mod m).A051024
Values of n for which pi_{4,3}(p_n) - pi_{4,1}(p_n) = -1, where p_n is the n-th prime and pi_{m,a}(x) is the number of primes <= x which are congruent to a (mod m).
- Primes p for which pi_{4,3}(p) - pi_{4,1}(p) = -1, where pi_{m,a}(x) is the number of primes <= x which are congruent to a (mod m).A051025
Primes p for which pi_{4,3}(p) - pi_{4,1}(p) = -1, where pi_{m,a}(x) is the number of primes <= x which are congruent to a (mod m).
- Number of primitive subsequences of {1, 2, ..., n}.A051026
Number of primitive subsequences of {1, 2, ..., n}.
- a(n) = sigma(sigma(n)) = sum of the divisors of the sum of the divisors of n.A051027
a(n) = sigma(sigma(n)) = sum of the divisors of the sum of the divisors of n.
- Ramanujan's a-series: expansion of (1+53x+9x^2)/(1-82x-82x^2+x^3).A051028
Ramanujan's a-series: expansion of (1+53x+9x^2)/(1-82x-82x^2+x^3).
- Ramanujan's b-series: expansion of (2-26x-12x^2)/(1-82x-82x^2+x^3).A051029
Ramanujan's b-series: expansion of (2-26x-12x^2)/(1-82x-82x^2+x^3).
- Ramanujan's c-series: expansion of (2+8*x-10*x^2)/(1-82*x-82*x^2+x^3).A051030
Ramanujan's c-series: expansion of (2+8*x-10*x^2)/(1-82*x-82*x^2+x^3).
- Triangle read by rows: T(n,r) is the number of not necessarily connected r-regular graphs with n nodes, 0 <= r < n.A051031
Triangle read by rows: T(n,r) is the number of not necessarily connected r-regular graphs with n nodes, 0 <= r < n.
- Summatory Rudin-Shapiro sequence for 2^(n-1).A051032
Summatory Rudin-Shapiro sequence for 2^(n-1).
- a(n) = binomial(n, floor(n/3)).A051033
a(n) = binomial(n, floor(n/3)).
- Minimal number of primes needed to sum to n.A051034
Minimal number of primes needed to sum to n.
- Composite numbers which can be represented as the sum of two primes (i.e., A002808 excluding A025583).A051035
Composite numbers which can be represented as the sum of two primes (i.e., A002808 excluding A025583).
- a(n) = binomial(n, floor(n/4)).A051036
a(n) = binomial(n, floor(n/4)).
- 5-smooth numbers, i.e., numbers whose prime divisors are all <= 5.A051037
5-smooth numbers, i.e., numbers whose prime divisors are all <= 5.
- 11-smooth numbers: numbers whose prime divisors are all <= 11.A051038
11-smooth numbers: numbers whose prime divisors are all <= 11.
- 4-Stohr sequence.A051039
4-Stohr sequence.
- 5-Stohr sequence.A051040
5-Stohr sequence.
- Number of squarefree quaternary words of length n.A051041
Number of squarefree quaternary words of length n.
- Number of ternary cubefree words of length n.A051042
Number of ternary cubefree words of length n.
- Number of quaternary cubefree words of length n.A051043
Number of quaternary cubefree words of length n.
- Odd values of the PartitionsQ function A000009.A051044
Odd values of the PartitionsQ function A000009.
- Number of distinct resistances possible for n resistors with resistances 1, 2, ..., n, each connected in series or parallel to the previous one.A051045
Number of distinct resistances possible for n resistors with resistances 1, 2, ..., n, each connected in series or parallel to the previous one.
- Numbers k for which pi(k) > k/(H_k - 3/2), where pi is the prime-counting function and H_k is the k-th harmonic number.A051046
Numbers k for which pi(k) > k/(H_k - 3/2), where pi is the prime-counting function and H_k is the k-th harmonic number.
- For n > 5, a(n) = 15*a(n-1) - 15*a(n-2) + a(n-3); initial terms are 1, 3, 8, 120, 1680.A051047
For n > 5, a(n) = 15*a(n-1) - 15*a(n-2) + a(n-3); initial terms are 1, 3, 8, 120, 1680.
- Sqrt[a(n)a(n+1)+1] of A051047.A051048
Sqrt[a(n)a(n+1)+1] of A051047.
- Number of moves needed to solve an (n+1)-ring baguenaudier if two simultaneous moves of the two end rings are counted as one.A051049
Number of moves needed to solve an (n+1)-ring baguenaudier if two simultaneous moves of the two end rings are counted as one.
- Numerator of the probability that the convex hull of n+2 randomly chosen points in the unit ball B^n has n+1 vertices.A051050
Numerator of the probability that the convex hull of n+2 randomly chosen points in the unit ball B^n has n+1 vertices.
- Denominators of the probability that the convex hull of n+2 randomly chosen points in the unit ball B^n has n+1 vertices (with factor of Pi^n dropped for n even).A051051
Denominators of the probability that the convex hull of n+2 randomly chosen points in the unit ball B^n has n+1 vertices (with factor of Pi^n dropped for n even).
- a(n) = binomial(n, floor(n/5)).A051052
a(n) = binomial(n, floor(n/5)).
- a(n) = binomial(n, floor(n/6)).A051053
a(n) = binomial(n, floor(n/6)).
- a(n) = Sum_{k=1..n} C(n, floor(n/k)).A051054
a(n) = Sum_{k=1..n} C(n, floor(n/k)).
- 'Connected' alternating sign n X n matrices, i.e., not made from smaller blocks.A051055
'Connected' alternating sign n X n matrices, i.e., not made from smaller blocks.
- Record subsequence of b(3k), b()=A048142().A051056
Record subsequence of b(3k), b()=A048142().
- Record subsequence of b(3k+1), b()=A048142().A051057
Record subsequence of b(3k+1), b()=A048142().
- Record subsequence of b(3k+2), b()=A048142().A051058
Record subsequence of b(3k+2), b()=A048142().
- a(n) = A048141(3*n+1).A051059
a(n) = A048141(3*n+1).
- a(n) = A048141(3*n+2).A051060
a(n) = A048141(3*n+2).