Sequences
392,541 sequences
- Product of terms in n-th row of A076110.A076111
Product of terms in n-th row of A076110.
- Triangle (read by rows) in which the n-th row contains first n terms of n geometric progression with first term 1 and common ratio (n-1).A076112
Triangle (read by rows) in which the n-th row contains first n terms of n geometric progression with first term 1 and common ratio (n-1).
- a(n) = n^(n*(n-1)/2).A076113
a(n) = n^(n*(n-1)/2).
- a(n) = start of the smallest string of n consecutive positive integers with a square sum, or 0 if no such number exists.A076114
a(n) = start of the smallest string of n consecutive positive integers with a square sum, or 0 if no such number exists.
- Squares (or 0) from A076114.A076115
Squares (or 0) from A076114.
- Start of the smallest string of n consecutive positive numbers with a cube sum, or 0 if no such number exists.A076116
Start of the smallest string of n consecutive positive numbers with a cube sum, or 0 if no such number exists.
- Cubes (or 0) from A076116.A076117
Cubes (or 0) from A076116.
- a(n) = Sum_{k=n/2..n} k * (-1)^(n-k) * C(k,n-k).A076118
a(n) = Sum_{k=n/2..n} k * (-1)^(n-k) * C(k,n-k).
- Every second sector of a dartboard, starting at the top (20) and working around clockwise.A076119
Every second sector of a dartboard, starting at the top (20) and working around clockwise.
- a(n) = smallest multiple of n other than n which is relatively prime to both a(n-1) and a(n+1).A076120
a(n) = smallest multiple of n other than n which is relatively prime to both a(n-1) and a(n+1).
- Complete list of possible cribbage hands.A076121
Complete list of possible cribbage hands.
- a(1)=1, a(2)=2 and then n^2 times a(n) is the product of its neighbors.A076122
a(1)=1, a(2)=2 and then n^2 times a(n) is the product of its neighbors.
- Rearrangement of natural numbers so that the product of n terms starting from a(n) is a square.A076123
Rearrangement of natural numbers so that the product of n terms starting from a(n) is a square.
- Square roots of squares pertaining to A076123.A076124
Square roots of squares pertaining to A076123.
- Define r(k) as follows: r(1)=n, r(k+1) = r(k) +(-1)^k*sign(r(k)-k)*k; then abs(r(k)) = n for at least one k>1 (there could be 2 values for k > 1). Sequence gives the smallest value of k > 1 such that abs(r(k)) = n.A076125
Define r(k) as follows: r(1)=n, r(k+1) = r(k) +(-1)^k*sign(r(k)-k)*k; then abs(r(k)) = n for at least one k>1 (there could be 2 values for k > 1). Sequence gives the smallest value of k > 1 such that abs(r(k)) = n.
- Triangle T(n,k) of associated Lah numbers, n>=2, k=1..floor(n/2).A076126
Triangle T(n,k) of associated Lah numbers, n>=2, k=1..floor(n/2).
- n-th term is binary string of length t_n with 1's at positions t_i, where t_n = n-th triangular number.A076127
n-th term is binary string of length t_n with 1's at positions t_i, where t_n = n-th triangular number.
- Difference between the product of numbers up to n and the sum of numbers up to n.A076128
Difference between the product of numbers up to n and the sum of numbers up to n.
- Position of first n-digit prime encountered in decimal expansion of Pi (ignoring the initial 3).A076129
Position of first n-digit prime encountered in decimal expansion of Pi (ignoring the initial 3).
- Out of all the n-digit primes, which one takes the longest time to appear in the digits of Pi (ignoring the initial 3)? The answer is A076106(n) and the position where this prime appears is a(n).A076130
Out of all the n-digit primes, which one takes the longest time to appear in the digits of Pi (ignoring the initial 3)? The answer is A076106(n) and the position where this prime appears is a(n).
- a(n) = 2^n*a(n-1) + 1, a(0) = 0.A076131
a(n) = 2^n*a(n-1) + 1, a(0) = 0.
- a(1) = 1; for n > 1, a(n) = Sum{a(n-k)^k | 0<k<n}.A076132
a(1) = 1; for n > 1, a(n) = Sum{a(n-k)^k | 0<k<n}.
- Numbers k such that 2*k! - 1 is prime.A076133
Numbers k such that 2*k! - 1 is prime.
- Numbers k such that 3*k! - 1 is prime.A076134
Numbers k such that 3*k! - 1 is prime.
- Numbers n such that O(n) = E(n)-1, where O(n), E(n) denote the number of integers k, 1 <= k <= n, such that Omega(n) is even or odd, respectively and Omega(n) denotes the number of prime factors of n, counting multiplicity.A076135
Numbers n such that O(n) = E(n)-1, where O(n), E(n) denote the number of integers k, 1 <= k <= n, such that Omega(n) is even or odd, respectively and Omega(n) denotes the number of prime factors of n, counting multiplicity.
- Numbers n such that Omega(n) = Omega(n-1) + Omega(n-2), where Omega(n) (A001222) denotes the number of prime factors of n, counting multiplicity.A076136
Numbers n such that Omega(n) = Omega(n-1) + Omega(n-2), where Omega(n) (A001222) denotes the number of prime factors of n, counting multiplicity.
- Numbers k such that Omega(k) = Omega(k-1) + Omega(k-2) + Omega(k-3), where Omega(n) denotes the number of prime factors of n, with multiplicity.A076137
Numbers k such that Omega(k) = Omega(k-1) + Omega(k-2) + Omega(k-3), where Omega(n) denotes the number of prime factors of n, with multiplicity.
- a(1)=1; a(n+1) is the smallest integer > a(n) such that C_2k(a(n+1))=C_2k(a(n)) for k large enough, where C_m(n) is the modified Collatz map iterated m times on n ( x->x/2 if x is even x->(3x+1)/2 if x is odd).A076138
a(1)=1; a(n+1) is the smallest integer > a(n) such that C_2k(a(n+1))=C_2k(a(n)) for k large enough, where C_m(n) is the modified Collatz map iterated m times on n ( x->x/2 if x is even x->(3x+1)/2 if x is odd).
- Triangular numbers that are one-third of another triangular number: T(m) such that 3*T(m) = T(k) for some k.A076139
Triangular numbers that are one-third of another triangular number: T(m) such that 3*T(m) = T(k) for some k.
- Triangular numbers T(k) that are three times another triangular number: T(k) such that T(k) = 3*T(m) for some m.A076140
Triangular numbers T(k) that are three times another triangular number: T(k) such that T(k) = 3*T(m) for some m.
- Number of times n occurs as a binary sub-pattern of n^2.A076141
Number of times n occurs as a binary sub-pattern of n^2.
- a(n) = A064097(n) - A003313(n).A076142
a(n) = A064097(n) - A003313(n).
- Number of permutations p(1),...,p(n) of 1,...,n such that gcd(Sum_{k=1..m} p(k), p(m+1)) = 1 for all positive integers m <= n-1.A076143
Number of permutations p(1),...,p(n) of 1,...,n such that gcd(Sum_{k=1..m} p(k), p(m+1)) = 1 for all positive integers m <= n-1.
- Largest squarefree m <= sfn(n) such that m*sfn(n) is also squarefree, where sfn(n) is the n-th squarefree number.A076144
Largest squarefree m <= sfn(n) such that m*sfn(n) is also squarefree, where sfn(n) is the n-th squarefree number.
- Floor of arithmetic-geometric mean of n and n^2.A076145
Floor of arithmetic-geometric mean of n and n^2.
- a(1) = 1; a(n) = a(n-1)*prime(a(n-1)).A076146
a(1) = 1; a(n) = a(n-1)*prime(a(n-1)).
- Numbers k such that the k-th prime + k is a cube.A076147
Numbers k such that the k-th prime + k is a cube.
- Let b(1)=x, b(2)=y, k*b(k)=(2k-1)*b(k-1) + 3(k+1)*b(k-2); then b(n)=a(n)*x+c(n)/3*y.A076148
Let b(1)=x, b(2)=y, k*b(k)=(2k-1)*b(k-1) + 3(k+1)*b(k-2); then b(n)=a(n)*x+c(n)/3*y.
- Expansion of x^2(3+2x)/(1-x-5x^2-3x^3).A076149
Expansion of x^2(3+2x)/(1-x-5x^2-3x^3).
- Start of 10 consecutive composite numbers.A076150
Start of 10 consecutive composite numbers.
- a(n) = (n-1)!*binomial(3*n,n)/(3*(2*n+1)).A076151
a(n) = (n-1)!*binomial(3*n,n)/(3*(2*n+1)).
- Let c = Sum_{k>=0} 1/2^(k!). Sequence gives values of terms not congruent to 5 in the continued fraction for c.A076152
Let c = Sum_{k>=0} 1/2^(k!). Sequence gives values of terms not congruent to 5 in the continued fraction for c.
- Numbers n such that Omega(n) = Omega(n-1)^2, where Omega(m) (A001222) denotes the number of prime factors of m, counted with multiplicity.A076153
Numbers n such that Omega(n) = Omega(n-1)^2, where Omega(m) (A001222) denotes the number of prime factors of m, counted with multiplicity.
- Let c = Sum_{k>=0} 1/2^(k!), sequence gives values of terms congruent to 5 of the continued fraction for c.A076154
Let c = Sum_{k>=0} 1/2^(k!), sequence gives values of terms congruent to 5 of the continued fraction for c.
- Omega(n) = Omega(n-1)^3, where Omega(m) (A001222) denotes the number of prime factors of m, counting multiplicity.A076155
Omega(n) = Omega(n-1)^3, where Omega(m) (A001222) denotes the number of prime factors of m, counting multiplicity.
- Numbers n such that Omega(n+1) = Omega(n)+1, where Omega(m) (A001222) denotes the number of prime factors of m, counting multiplicity.A076156
Numbers n such that Omega(n+1) = Omega(n)+1, where Omega(m) (A001222) denotes the number of prime factors of m, counting multiplicity.
- Continued fraction expansion for c = Sum_{k>=0} 1/2^(k!).A076157
Continued fraction expansion for c = Sum_{k>=0} 1/2^(k!).
- a(n) = the least positive integer k such that Omega(n+k) = Omega(k)+n, where Omega(m) (A001222) denotes the number of prime factors of m, counting multiplicity.A076158
a(n) = the least positive integer k such that Omega(n+k) = Omega(k)+n, where Omega(m) (A001222) denotes the number of prime factors of m, counting multiplicity.
- Numbers k such that k = sod_4 - sod_3 + sod_2 - sod_1, where sod_j is the sum of j-th powers of digits of k.A076159
Numbers k such that k = sod_4 - sod_3 + sod_2 - sod_1, where sod_j is the sum of j-th powers of digits of k.
- Sod_4 - sod_3 + sod_2 - sod_1, where sod_k is the sum of k-th powers of digits of n.A076160
Sod_4 - sod_3 + sod_2 - sod_1, where sod_k is the sum of k-th powers of digits of n.