Sequences
392,541 sequences
- Array read by rows: T(n,k) = binomial(n+k-2,k-1)*binomial(2*n-1,n-k).A091811
Array read by rows: T(n,k) = binomial(n+k-2,k-1)*binomial(2*n-1,n-k).
- Decimal expansion of Sum_{k>=1} (-1)^k*log(k)/k.A091812
Decimal expansion of Sum_{k>=1} (-1)^k*log(k)/k.
- Number of positive squarefree integers k<=n satisfying gcd_*(k,n)=1, where gcd_*(k,n) is the greatest divisor of k that is also a unitary divisor of n.A091813
Number of positive squarefree integers k<=n satisfying gcd_*(k,n)=1, where gcd_*(k,n) is the greatest divisor of k that is also a unitary divisor of n.
- Numerator of I(n) = (integral_{x=0..1/2}(1-x^2)^n,dx), where the denominator is b(n) = 2^n*(2*n+2)!/(n+1)!.A091814
Numerator of I(n) = (integral_{x=0..1/2}(1-x^2)^n,dx), where the denominator is b(n) = 2^n*(2*n+2)!/(n+1)!.
- Numbers m such that the numerator of Sum_{i=1..m} (i-1)/i is prime.A091815
Numbers m such that the numerator of Sum_{i=1..m} (i-1)/i is prime.
- Numbers m such that the numerator of Sum_{i=1..m} (i+1)/i is prime.A091816
Numbers m such that the numerator of Sum_{i=1..m} (i+1)/i is prime.
- (2*numerator(H(p-3)) -3*denominator(H(p-3)))/p with H(m) = 1 + 1/2 + 1/3 + ...+ 1/m.A091817
(2*numerator(H(p-3)) -3*denominator(H(p-3)))/p with H(m) = 1 + 1/2 + 1/3 + ...+ 1/m.
- Sum of the even proper divisors of 2n. Sum of the even divisors of 2n that are less than 2n.A091818
Sum of the even proper divisors of 2n. Sum of the even divisors of 2n that are less than 2n.
- Numbers k that have, in binary, the same number of ones as are in k^2 and which have no nonincreasing binary representation.A091819
Numbers k that have, in binary, the same number of ones as are in k^2 and which have no nonincreasing binary representation.
- Number of ways to reach a sum of n by a down-only cascade through Pascal's Triangle, starting at C(0,0)=1 at the apex and shifting left or right by exactly one position at each step.A091820
Number of ways to reach a sum of n by a down-only cascade through Pascal's Triangle, starting at C(0,0)=1 at the apex and shifting left or right by exactly one position at each step.
- a(n) counts the one-bits in the binary representation of n when we cycle from left to right through the individual bits of n, restarting at the leftmost bit after the rightmost is reached and performing n bitwise steps in total.A091821
a(n) counts the one-bits in the binary representation of n when we cycle from left to right through the individual bits of n, restarting at the leftmost bit after the rightmost is reached and performing n bitwise steps in total.
- a(n)=2*sum(k=0,n,sum(i=0,k,sum(j=0,i, A010060(j))))-(1/6)*(n^3+6*n^2+11*n-6).A091822
a(n)=2*sum(k=0,n,sum(i=0,k,sum(j=0,i, A010060(j))))-(1/6)*(n^3+6*n^2+11*n-6).
- a(n) = 2*n^2 + 3*n - 1.A091823
a(n) = 2*n^2 + 3*n - 1.
- Numbers p such that ((p-1)!*2^(p-1) + 1)/p is a prime.A091824
Numbers p such that ((p-1)!*2^(p-1) + 1)/p is a prime.
- Integers of the form ((k-1)!*2^(k-1) + 1)/k.A091825
Integers of the form ((k-1)!*2^(k-1) + 1)/k.
- (1/p)*(1+A000254(p)-p) as p runs through the primes.A091826
(1/p)*(1+A000254(p)-p) as p runs through the primes.
- Least k such that k^n divides A000254(k).A091827
Least k such that k^n divides A000254(k).
- a(n)=n-2*valuation(A000254(n),3).A091828
a(n)=n-2*valuation(A000254(n),3).
- a(1)=1; a(2n)=a(n)+1, a(2n+1)=a(n) mod 2.A091829
a(1)=1; a(2n)=a(n)+1, a(2n+1)=a(n) mod 2.
- a(1)=1; a(2n)=(a(n)+1) mod 2, a(2n+1)=a(2n)+1.A091830
a(1)=1; a(2n)=(a(n)+1) mod 2, a(2n+1)=a(2n)+1.
- Pierce expansion of 1/sqrt(2).A091831
Pierce expansion of 1/sqrt(2).
- Pierce expansion of 1/e^2.A091832
Pierce expansion of 1/e^2.
- Pierce expansion of 1/zeta(2).A091833
Pierce expansion of 1/zeta(2).
- Triangle read by rows: T(n,k) = maximum denominator in the Egyptian fraction representation that minimizes the maximum denominator of the k-th entry of row n of the triangle of numbers 1/2; 1/3, 2/3; 1/4, 2/4, 3/4; ...A091834
Triangle read by rows: T(n,k) = maximum denominator in the Egyptian fraction representation that minimizes the maximum denominator of the k-th entry of row n of the triangle of numbers 1/2; 1/3, 2/3; 1/4, 2/4, 3/4; ...
- Double factorial of primes.A091835
Double factorial of primes.
- A triangle of Motzkin ballot numbers.A091836
A triangle of Motzkin ballot numbers.
- Smallest b>1 such that 11*n is a repdigit in base b.A091837
Smallest b>1 such that 11*n is a repdigit in base b.
- a(n) is the number of images of the border correlation function for binary words of length n (cf. link).A091838
a(n) is the number of images of the border correlation function for binary words of length n (cf. link).
- A smoothed version of A091579.A091839
A smoothed version of A091579.
- Lengths of suffix blocks associated with A091787.A091840
Lengths of suffix blocks associated with A091787.
- Records in A091840.A091841
Records in A091840.
- Lengths of suffix blocks associated with A091799.A091842
Lengths of suffix blocks associated with A091799.
- Records in A091842.A091843
Records in A091842.
- a(1) = 4. To get a(n+1), write the string a(1)a(2)...a(n) as xy^k for words x and y (where y has positive length) and k is maximized, i.e., k = the maximal number of repeating blocks at the end of the sequence so far. Then a(n+1) = max(k,4).A091844
a(1) = 4. To get a(n+1), write the string a(1)a(2)...a(n) as xy^k for words x and y (where y has positive length) and k is maximized, i.e., k = the maximal number of repeating blocks at the end of the sequence so far. Then a(n+1) = max(k,4).
- Records in sequence of lengths of suffix blocks associated with A091844.A091845
Records in sequence of lengths of suffix blocks associated with A091844.
- Pierce expansion of log(2).A091846
Pierce expansion of log(2).
- Perfect totient numbers, omitting powers of 3.A091847
Perfect totient numbers, omitting powers of 3.
- Johnson bound J(n,4,2).A091848
Johnson bound J(n,4,2).
- Maximal size of (n,4,2) optical orthogonal code.A091849
Maximal size of (n,4,2) optical orthogonal code.
- a(1) = 1; a(n) is the smallest positive integer not already in the sequence such that Sum_{k=1..n} k*a(k) is a prime.A091850
a(1) = 1; a(n) is the smallest positive integer not already in the sequence such that Sum_{k=1..n} k*a(k) is a prime.
- a(1) = 1; then primes associated with A091850.A091851
a(1) = 1; then primes associated with A091850.
- Numerator of Sum_{i=1..n} prime(i)/prime(i+1).A091852
Numerator of Sum_{i=1..n} prime(i)/prime(i+1).
- a(n) is the number of numbers k such that k is obtained by permuting the digits of n and gcd(n,k) > 1.A091853
a(n) is the number of numbers k such that k is obtained by permuting the digits of n and gcd(n,k) > 1.
- Index of first occurrence of n in A091853, or 0 if no such number exists.A091854
Index of first occurrence of n in A091853, or 0 if no such number exists.
- Odious numbers (see A000069) in A003159.A091855
Odious numbers (see A000069) in A003159.
- Beginning with 1, minimum value such that gcd(a(2n-1),a(2n)) = 1, gcd(a(2n),a(2n+1))>1 and a(n) > a(n-1).A091856
Beginning with 1, minimum value such that gcd(a(2n-1),a(2n)) = 1, gcd(a(2n),a(2n+1))>1 and a(n) > a(n-1).
- Beginning with 1, (a(2n-1),a(2n)) = 1, (a(2n),a(2n+1))>1; a(n) is smallest value not yet used that makes this true.A091857
Beginning with 1, (a(2n-1),a(2n)) = 1, (a(2n),a(2n+1))>1; a(n) is smallest value not yet used that makes this true.
- a(n) = n! mod prime(n).A091858
a(n) = n! mod prime(n).
- a(1) = 2, a(n) is the least prime of the form 2k*a(n-1)+1 where 2k is the least even number not used earlier.A091859
a(1) = 2, a(n) is the least prime of the form 2k*a(n-1)+1 where 2k is the least even number not used earlier.
- a(1)=1, a(n)=sum(i=1,n-1,b(i)) where b(i)=0 if a(i) and a(n-i) are both even, b(i)=1 otherwise.A091860
a(1)=1, a(n)=sum(i=1,n-1,b(i)) where b(i)=0 if a(i) and a(n-i) are both even, b(i)=1 otherwise.