Sequences
392,541 sequences
- Partial sum of pi(k) from k = 1 to 2^n.A072111
Partial sum of pi(k) from k = 1 to 2^n.
- Decimal expansion of Hall and Tenenbaum constant.A072112
Decimal expansion of Hall and Tenenbaum constant.
- Continued fraction expansion of Hall and Tenenbaum constant.A072113
Continued fraction expansion of Hall and Tenenbaum constant.
- Number of 3-almost primes (A014612) <= n.A072114
Number of 3-almost primes (A014612) <= n.
- Continued fraction expansion of abs(C) where C=-0.2959050055752...is the real negative solution to zeta(x)=x.A072115
Continued fraction expansion of abs(C) where C=-0.2959050055752...is the real negative solution to zeta(x)=x.
- a(n) = (2n)!/(phi(2n)!)^2.A072116
a(n) = (2n)!/(phi(2n)!)^2.
- Continued fraction expansion of smallest Pisot-Vijayaraghavan number (positive root of x^3 = x + 1 ).A072117
Continued fraction expansion of smallest Pisot-Vijayaraghavan number (positive root of x^3 = x + 1 ).
- a(n) = (2*n)!/core(n!)^2/(n+1) where core(x) is the squarefree part of x.A072118
a(n) = (2*n)!/core(n!)^2/(n+1) where core(x) is the squarefree part of x.
- Least k such that k(k+1)(k+2)...(k+n) divides C(2k,k).A072119
Least k such that k(k+1)(k+2)...(k+n) divides C(2k,k).
- Least k such that n! divides C(2k,k).A072120
Least k such that n! divides C(2k,k).
- a(1) = 1; for n > 1, a(n) = smallest number > a(n-1) having at least n divisors.A072121
a(1) = 1; for n > 1, a(n) = smallest number > a(n-1) having at least n divisors.
- Numbers with 12 odd integers in their Collatz (or 3x+1) trajectory.A072122
Numbers with 12 odd integers in their Collatz (or 3x+1) trajectory.
- Remainder when Fibonacci(n) is divided by prime(n).A072123
Remainder when Fibonacci(n) is divided by prime(n).
- a(n)-th factorial is the smallest factorial containing exactly n 1's, or 0 if no such number exists.A072124
a(n)-th factorial is the smallest factorial containing exactly n 1's, or 0 if no such number exists.
- Concatenation of first n entries (digits) of A007376 is not divisible by 3.A072125
Concatenation of first n entries (digits) of A007376 is not divisible by 3.
- Parity of the decimal digits of log(2).A072126
Parity of the decimal digits of log(2).
- Number of equivalence classes of pairs of complex Golay sequences of length n.A072127
Number of equivalence classes of pairs of complex Golay sequences of length n.
- Number of pairs of complex Golay sequences of length n.A072128
Number of pairs of complex Golay sequences of length n.
- Number of distinct ways of arranging the squares {1,4,9,...,(2n)^2} in a circle so that the sum of each two adjacent entries is a prime.A072129
Number of distinct ways of arranging the squares {1,4,9,...,(2n)^2} in a circle so that the sum of each two adjacent entries is a prime.
- a(n+1) - 3*a(n) + a(n-1) = (2/3)*(1+w^(n+1)+w^(2*n+2)); a(1) = 0, a(2) = 1; where w is the cubic root of unity.A072130
a(n+1) - 3*a(n) + a(n-1) = (2/3)*(1+w^(n+1)+w^(2*n+2)); a(1) = 0, a(2) = 1; where w is the cubic root of unity.
- T_7(n) in the notation of Bergeron et al., u_k(n) in the notation of Gessel: Related to Young tableaux of bounded height.A072131
T_7(n) in the notation of Bergeron et al., u_k(n) in the notation of Gessel: Related to Young tableaux of bounded height.
- T_8(n) in the notation of Bergeron et al., u_k(n) in the notation of Gessel: Related to Young tableaux of bounded height.A072132
T_8(n) in the notation of Bergeron et al., u_k(n) in the notation of Gessel: Related to Young tableaux of bounded height.
- T_9(n) in the notation of Bergeron et al., u_k(n) in the notation of Gessel: Related to Young tableaux of bounded height.A072133
T_9(n) in the notation of Bergeron et al., u_k(n) in the notation of Gessel: Related to Young tableaux of bounded height.
- Second generation sequence in which each number is skipped that can be written as sum of distinct previous entries. To make the first generation we start with all natural numbers: this gives the powers of 2 (A000079). For the second generation we start with the natural numbers from which are removed the numbers of the first generation.A072134
Second generation sequence in which each number is skipped that can be written as sum of distinct previous entries. To make the first generation we start with all natural numbers: this gives the powers of 2 (A000079). For the second generation we start with the natural numbers from which are removed the numbers of the first generation.
- Least m such that sqrt(m) has a period 2n continued fraction expansion whose palindrome part concatenates to a palindromic prime.A072135
Least m such that sqrt(m) has a period 2n continued fraction expansion whose palindrome part concatenates to a palindromic prime.
- Position of the first zero in the fractional part of the base n expansion of Pi.A072136
Position of the first zero in the fractional part of the base n expansion of Pi.
- Length of the preperiodic part of the 'Reverse and Subtract' trajectory of n.A072137
Length of the preperiodic part of the 'Reverse and Subtract' trajectory of n.
- Smallest k whose 'Reverse and Subtract' trajectory has a preperiodic part of length n.A072138
Smallest k whose 'Reverse and Subtract' trajectory has a preperiodic part of length n.
- Last term of the preperiodic part of the 'Reverse and Subtract' trajectory of n, or -1 if the trajectory is completely periodic.A072139
Last term of the preperiodic part of the 'Reverse and Subtract' trajectory of n, or -1 if the trajectory is completely periodic.
- The period length of the 'Reverse and Subtract' trajectory of n is greater than 1.A072140
The period length of the 'Reverse and Subtract' trajectory of n is greater than 1.
- Numbers n such that two applications of 'Reverse and Subtract' lead to n, whereas one application does not lead to n.A072141
Numbers n such that two applications of 'Reverse and Subtract' lead to n, whereas one application does not lead to n.
- Numbers k such that 14 applications of 'Reverse and Subtract' lead to k, whereas fewer than 14 applications do not lead to k.A072142
Numbers k such that 14 applications of 'Reverse and Subtract' lead to k, whereas fewer than 14 applications do not lead to k.
- Numbers n such that 22 applications of 'Reverse and Subtract' lead to n, whereas fewer than 22 applications do not lead to n.A072143
Numbers n such that 22 applications of 'Reverse and Subtract' lead to n, whereas fewer than 22 applications do not lead to n.
- Numbers n such that the period length of the 'Reverse and Subtract' trajectory of n is greater than 2.A072144
Numbers n such that the period length of the 'Reverse and Subtract' trajectory of n is greater than 2.
- Numbers k such that the period of the 'Reverse and Subtract' trajectory of k is greater than 14.A072145
Numbers k such that the period of the 'Reverse and Subtract' trajectory of k is greater than 14.
- Numbers n with property that n sets a new record for the length of the preperiodic part of the 'Reverse and Subtract' trajectory of n.A072146
Numbers n with property that n sets a new record for the length of the preperiodic part of the 'Reverse and Subtract' trajectory of n.
- Records for the length of the preperiodic part of the 'Reverse and Subtract' trajectories.A072147
Records for the length of the preperiodic part of the 'Reverse and Subtract' trajectories.
- Number of invertible (-1,0,1) n X n matrices having (Tij = -Tji; i<j) such that all T^k (k= 1..12) are also (-1,0,1) matrices.A072148
Number of invertible (-1,0,1) n X n matrices having (Tij = -Tji; i<j) such that all T^k (k= 1..12) are also (-1,0,1) matrices.
- Coordination sequence for AlPO_4-11 structure with respect to node (X) where decagon and two hexagons meet.A072149
Coordination sequence for AlPO_4-11 structure with respect to node (X) where decagon and two hexagons meet.
- Coordination sequence for AlPO_4-11 structure with respect to node (Y) where decagon, hexagon and square meet and is adjacent to node of type (X).A072150
Coordination sequence for AlPO_4-11 structure with respect to node (Y) where decagon, hexagon and square meet and is adjacent to node of type (X).
- Coordination sequence for AlPO_4-11 structure with respect to node (Z) where decagon, hexagon and square meet and is not adjacent to node of type (X).A072151
Coordination sequence for AlPO_4-11 structure with respect to node (Z) where decagon, hexagon and square meet and is not adjacent to node of type (X).
- Coordination sequence for VPl-5 structure with respect to node (X) where 18-gon and two squares meet.A072152
Coordination sequence for VPl-5 structure with respect to node (X) where 18-gon and two squares meet.
- Coordination sequence for VPl-5 structure with respect to node (Y) where 18-gon, hexagon and square meet.A072153
Coordination sequence for VPl-5 structure with respect to node (Y) where 18-gon, hexagon and square meet.
- Coordination sequence for the planar net 4.6.12.A072154
Coordination sequence for the planar net 4.6.12.
- Denominator of Sum_{k=1..n} phi(k)/k.A072155
Denominator of Sum_{k=1..n} phi(k)/k.
- Numerator of Sum_{k=1..n} phi(k)/k^2.A072156
Numerator of Sum_{k=1..n} phi(k)/k^2.
- Denominator of Sum_{k=1..n} phi(k)/k^2.A072157
Denominator of Sum_{k=1..n} phi(k)/k^2.
- Numerator of Sum_{k=1..n} phi(k)/k^3.A072158
Numerator of Sum_{k=1..n} phi(k)/k^3.
- Denominator of Sum_{k=1..n} phi(k)/k^3.A072159
Denominator of Sum_{k=1..n} phi(k)/k^3.
- Numerator of Sum_{k=1..n} phi(k)/k^4.A072160
Numerator of Sum_{k=1..n} phi(k)/k^4.