Sequences
392,541 sequences
- One minus the parity of 1-fibits in Zeckendorf expansion A014417(n).A095111
One minus the parity of 1-fibits in Zeckendorf expansion A014417(n).
- a(n) is the sum of n/k over all prime powers k > 1 which divide n.A095112
a(n) is the sum of n/k over all prime powers k > 1 which divide n.
- a(1)=1. a(n) is the sum of n/d over all divisors d of n which are among a(1), ..., a(n-1).A095113
a(1)=1. a(n) is the sum of n/d over all divisors d of n which are among a(1), ..., a(n-1).
- a(1)=1. a(n) = a(n-1) + (number of elements of {a(1),...,a(n-1)} that are <= n-1).A095114
a(1)=1. a(n) = a(n-1) + (number of elements of {a(1),...,a(n-1)} that are <= n-1).
- a(1)=1. Given a(1),...,a(n-1), to find a(n), let S = {a(1), ..., a(n-1), |a(2)-a(1)|, ..., |a(n-1)-a(n-2)|}. Let d be the smallest positive integer not in S. Then a(n) is the smallest one of a(n-1)-d and a(n-1)+d which is a positive integer not in S union {d}.A095115
a(1)=1. Given a(1),...,a(n-1), to find a(n), let S = {a(1), ..., a(n-1), |a(2)-a(1)|, ..., |a(n-1)-a(n-2)|}. Let d be the smallest positive integer not in S. Then a(n) is the smallest one of a(n-1)-d and a(n-1)+d which is a positive integer not in S union {d}.
- a(n) = prime(n) + n - 1.A095116
a(n) = prime(n) + n - 1.
- a(n) = pi(n) + n, where pi(n) = A000720(n) is the number of primes <= n.A095117
a(n) = pi(n) + n, where pi(n) = A000720(n) is the number of primes <= n.
- a(n) is the sum of the squares of the divisors of n which are <= sqrt(n).A095118
a(n) is the sum of the squares of the divisors of n which are <= sqrt(n).
- Numbers k such that s(k) >= sigma(k), where s(k) = A095118(k) is the sum of the squares of the divisors of k which are <= sqrt(k) and sigma(k) = A000203(k) is the sum of the divisors of k.A095119
Numbers k such that s(k) >= sigma(k), where s(k) = A095118(k) is the sum of the squares of the divisors of k which are <= sqrt(k) and sigma(k) = A000203(k) is the sum of the divisors of k.
- a(n) = prime(3^n - 1).A095120
a(n) = prime(3^n - 1).
- Expansion of (1-x+2x^2)/((1-x)*(1-2x)).A095121
Expansion of (1-x+2x^2)/((1-x)*(1-2x)).
- a(n) = Fibonacci(n)*(2*Fibonacci(n)-1).A095122
a(n) = Fibonacci(n)*(2*Fibonacci(n)-1).
- Expansion of ((eta(q)eta(q^15))/(eta(q^3)eta(q^5)))^3 in powers of q.A095123
Expansion of ((eta(q)eta(q^15))/(eta(q^3)eta(q^5)))^3 in powers of q.
- a(n) = prime(2^(2^n)).A095124
a(n) = prime(2^(2^n)).
- Expansion of -x*(-1-x+x^2) / ( 1-2*x-3*x^2+x^3 ).A095125
Expansion of -x*(-1-x+x^2) / ( 1-2*x-3*x^2+x^3 ).
- Expansion of x*(4+5*x-x^2)/ (1-2*x-3*x^2+x^3).A095126
Expansion of x*(4+5*x-x^2)/ (1-2*x-3*x^2+x^3).
- a(n+3) = 2*a(n+2) + 3*a(n+1) - a(n); with a(1) = 1, a(2) = 4, a(3) = 10.A095127
a(n+3) = 2*a(n+2) + 3*a(n+1) - a(n); with a(1) = 1, a(2) = 4, a(3) = 10.
- a(n+3) = 3*a(n+2) + 2*a(n+1) - a(n).A095128
a(n+3) = 3*a(n+2) + 2*a(n+1) - a(n).
- Jac(n)(2Jac(n)-1).A095129
Jac(n)(2Jac(n)-1).
- Expansion of (x+x^2)/(1-x^6); period 6: repeat [0, 1, 1, 0, 0, 0].A095130
Expansion of (x+x^2)/(1-x^6); period 6: repeat [0, 1, 1, 0, 0, 0].
- Numerators of average numbers of trees in a forest on n nodes.A095131
Numerators of average numbers of trees in a forest on n nodes.
- Denominators of average numbers of trees in a forest on n nodes.A095132
Denominators of average numbers of trees in a forest on n nodes.
- Triangle of numbers of forests on n nodes containing k trees.A095133
Triangle of numbers of forests on n nodes containing k trees.
- Sum of the product of the first ceiling(n/2) odd-indexed primes and the product of the first floor(n/2) even-indexed primes; a(1) = 2.A095134
Sum of the product of the first ceiling(n/2) odd-indexed primes and the product of the first floor(n/2) even-indexed primes; a(1) = 2.
- Indices of primes in A095134(n).A095135
Indices of primes in A095134(n).
- Number of distinct prime factors of A095134(n).A095136
Number of distinct prime factors of A095134(n).
- Absolute difference between the product of the first floor(n/2) even-indexed primes and the product of the first floor(n/2) odd-indexed primes.A095137
Absolute difference between the product of the first floor(n/2) even-indexed primes and the product of the first floor(n/2) odd-indexed primes.
- Indices of primes in A095137(n).A095138
Indices of primes in A095137(n).
- Number of distinct prime factors of A095137(n).A095139
Number of distinct prime factors of A095137(n).
- Triangle, read by rows, formed by reading Pascal's triangle (A007318) mod 5.A095140
Triangle, read by rows, formed by reading Pascal's triangle (A007318) mod 5.
- Triangle, read by rows, formed by reading Pascal's triangle (A007318) mod 6.A095141
Triangle, read by rows, formed by reading Pascal's triangle (A007318) mod 6.
- Triangle, read by rows, formed by reading Pascal's triangle (A007318) mod 7.A095142
Triangle, read by rows, formed by reading Pascal's triangle (A007318) mod 7.
- Triangle, read by rows, formed by reading Pascal's triangle (A007318) mod 9.A095143
Triangle, read by rows, formed by reading Pascal's triangle (A007318) mod 9.
- Triangle, read by rows, formed by reading Pascal's triangle (A007318) mod 11.A095144
Triangle, read by rows, formed by reading Pascal's triangle (A007318) mod 11.
- Triangle, read by rows, formed by reading Pascal's triangle (A007318) mod 12.A095145
Triangle, read by rows, formed by reading Pascal's triangle (A007318) mod 12.
- Even binomial coefficients: C(n,k), 2 <= k <= n-2, sorted, duplicates removed.A095146
Even binomial coefficients: C(n,k), 2 <= k <= n-2, sorted, duplicates removed.
- Odd binomial coefficients: C(n,k), 2 <= k <= n-2, sorted, duplicates removed.A095147
Odd binomial coefficients: C(n,k), 2 <= k <= n-2, sorted, duplicates removed.
- Shifts left under antidiagonal sums of the table (A095788) of iterated binomial transforms of this sequence.A095148
Shifts left under antidiagonal sums of the table (A095788) of iterated binomial transforms of this sequence.
- Triangle read by rows: Aitken's array (A011971) but with a leading diagonal before it given by the Bell numbers (A000110), 1, 1, 2, 5, 15, 52, ...A095149
Triangle read by rows: Aitken's array (A011971) but with a leading diagonal before it given by the Bell numbers (A000110), 1, 1, 2, 5, 15, 52, ...
- a(n) = prime(2^(2^n) + 1).A095150
a(n) = prime(2^(2^n) + 1).
- a(n+3) = 3*a(n+2) - 2*a(n+1) + 1 with a(0)=0, a(1)=2.A095151
a(n+3) = 3*a(n+2) - 2*a(n+1) + 1 with a(0)=0, a(1)=2.
- Number of 3-block covers of a labeled n-set.A095152
Number of 3-block covers of a labeled n-set.
- Number of 4-block covers of a labeled n-set.A095153
Number of 4-block covers of a labeled n-set.
- Number of 5-block covers of a labeled n-set.A095154
Number of 5-block covers of a labeled n-set.
- Number of 6-block covers of a labeled n-set.A095155
Number of 6-block covers of a labeled n-set.
- Least k such that 1/k begins with n after deleting the decimal point and the zeros following the decimal point.A095156
Least k such that 1/k begins with n after deleting the decimal point and the zeros following the decimal point.
- Least number beginning with n such that every partial sum is a prime.A095157
Least number beginning with n such that every partial sum is a prime.
- Least number beginning with n such that every partial sum is a square.A095158
Least number beginning with n such that every partial sum is a square.
- Numerator of b(n) given by b(1) = 1, b(2) = 2; for n >= 3, b(n) = (-1)^n (2n-1) ((n-2)!!)^2/((n-1)!!)^2, where n!! is the double factorial A006882.A095159
Numerator of b(n) given by b(1) = 1, b(2) = 2; for n >= 3, b(n) = (-1)^n (2n-1) ((n-2)!!)^2/((n-1)!!)^2, where n!! is the double factorial A006882.
- Let B(k) be the sum of binary digits of k. Sequence lists the numbers k such that B(k) = B(digit sum(k)).A095160
Let B(k) be the sum of binary digits of k. Sequence lists the numbers k such that B(k) = B(digit sum(k)).