Sequences
392,541 sequences
- Squarefree part of 2^n+1 : the smallest number such that a(n)*(2^n+1) is a square.A069111
Squarefree part of 2^n+1 : the smallest number such that a(n)*(2^n+1) is a square.
- Squarefree part of 2^n-1 : the smallest number such that a(n)*(2^n-1) is a square.A069112
Squarefree part of 2^n-1 : the smallest number such that a(n)*(2^n-1) is a square.
- Squarefree part of C(2n,n), the central binomial numbers: the smallest number such that a(n)*C(2n,n) is a square.A069113
Squarefree part of C(2n,n), the central binomial numbers: the smallest number such that a(n)*C(2n,n) is a square.
- Squarefree part of prime(n)-1 : the smallest number such that a(n)*(prime(n)-1) is a square.A069114
Squarefree part of prime(n)-1 : the smallest number such that a(n)*(prime(n)-1) is a square.
- Squarefree part of prime(n)+1 : the smallest number such that a(n)*(prime(n)+1) is a square.A069115
Squarefree part of prime(n)+1 : the smallest number such that a(n)*(prime(n)+1) is a square.
- Composite k such that the squarefree part of k is greater than sqrt(k).A069116
Composite k such that the squarefree part of k is greater than sqrt(k).
- Numbers n such that A068589(n) is a perfect square.A069117
Numbers n such that A068589(n) is a perfect square.
- Let D(n,s) denotes the denominator of Sum_{k=1..n} 1/k^s; sequence gives values of n such that D(n,4)/D(n,2) is a perfect square.A069118
Let D(n,s) denotes the denominator of Sum_{k=1..n} 1/k^s; sequence gives values of n such that D(n,4)/D(n,2) is a perfect square.
- Numbers k such that k!*Sum_{i=1..k} 1/(i*2^i) is an integer.A069119
Numbers k such that k!*Sum_{i=1..k} 1/(i*2^i) is an integer.
- Integers of the form k!*sum(i=1..k, 1/(i*2^i) ).A069120
Integers of the form k!*sum(i=1..k, 1/(i*2^i) ).
- a(n) = n^4*binomial(2*n,n).A069121
a(n) = n^4*binomial(2*n,n).
- Numbers k such that the squarefree part of k is greater than the squarefree part of (k+1).A069122
Numbers k such that the squarefree part of k is greater than the squarefree part of (k+1).
- Triangle formed as follows: For n-th row, n >= 0, record the A000041(n) partitions of n; for each partition, write down number of ways to arrange the parts.A069123
Triangle formed as follows: For n-th row, n >= 0, record the A000041(n) partitions of n; for each partition, write down number of ways to arrange the parts.
- Number of stable matchings in a certain form of Pseudo-Latin squares of order n based on Latin subsquares.A069124
Number of stable matchings in a certain form of Pseudo-Latin squares of order n based on Latin subsquares.
- a(n) = (11*n^2 - 11*n + 2)/2.A069125
a(n) = (11*n^2 - 11*n + 2)/2.
- Centered 13-gonal numbers.A069126
Centered 13-gonal numbers.
- Centered 14-gonal numbers.A069127
Centered 14-gonal numbers.
- Centered 15-gonal numbers: a(n) = (15*n^2 - 15*n + 2)/2.A069128
Centered 15-gonal numbers: a(n) = (15*n^2 - 15*n + 2)/2.
- Centered 16-gonal numbers.A069129
Centered 16-gonal numbers.
- Centered 17-gonal numbers: (17*n^2 - 17*n + 2)/2.A069130
Centered 17-gonal numbers: (17*n^2 - 17*n + 2)/2.
- Centered 18-gonal numbers.A069131
Centered 18-gonal numbers.
- Centered 19-gonal numbers.A069132
Centered 19-gonal numbers.
- Centered 20-gonal (or icosagonal) numbers.A069133
Centered 20-gonal (or icosagonal) numbers.
- (n!*(3*n))^2.A069134
(n!*(3*n))^2.
- a(n) = (n!*(n+1)!)^2.A069135
a(n) = (n!*(n+1)!)^2.
- Numbers that are not the sum of 5 nonnegative cubes.A069136
Numbers that are not the sum of 5 nonnegative cubes.
- Numbers which are sums of neither 1, 2, 3, 4, 5 or 6 nonnegative cubes.A069137
Numbers which are sums of neither 1, 2, 3, 4, 5 or 6 nonnegative cubes.
- Triangle formed by multiplying Stirling numbers of 2nd kind S2(n,m) (A008277) by m+1.A069138
Triangle formed by multiplying Stirling numbers of 2nd kind S2(n,m) (A008277) by m+1.
- Egyptian fraction for square root of 1/2.A069139
Egyptian fraction for square root of 1/2.
- a(n) = (4*n-1)*4*n*(4*n+1).A069140
a(n) = (4*n-1)*4*n*(4*n+1).
- a(n) = n^2*(n+1)!/(n^tau(n)) where tau(n) is the number of divisors of n.A069141
a(n) = n^2*(n+1)!/(n^tau(n)) where tau(n) is the number of divisors of n.
- Primes p such that p+2, 2p+1, and 2p+3 are also prime.A069142
Primes p such that p+2, 2p+1, and 2p+3 are also prime.
- a(1) = a(2) = 1; a(n) = sigma(a(n-1)+a(n-2)).A069143
a(1) = a(2) = 1; a(n) = sigma(a(n-1)+a(n-2)).
- Numbers k such that A068976(k) divides k.A069144
Numbers k such that A068976(k) divides k.
- Numbers k such that A069088(k) divides k.A069145
Numbers k such that A069088(k) divides k.
- Numbers m such that m = sigma(abs(k)) - 3k, where k = sigma(m) - 3m.A069146
Numbers m such that m = sigma(abs(k)) - 3k, where k = sigma(m) - 3m.
- Numbers k such that tau_3(k) (the number of ordered factorizations of k as k = r*s*t) divides k.A069147
Numbers k such that tau_3(k) (the number of ordered factorizations of k as k = r*s*t) divides k.
- Numbers k such that k*k!/A062758(k) is not an integer where A062758(k) is the product of squares of divisors of k.A069148
Numbers k such that k*k!/A062758(k) is not an integer where A062758(k) is the product of squares of divisors of k.
- Numbers k such that k*k!/A062758(k) is an integer where A062758(k) is the product of squares of divisors of k.A069149
Numbers k such that k*k!/A062758(k) is an integer where A062758(k) is the product of squares of divisors of k.
- Integers of the form k*k!/A062758(k) in the order they appear in A069149, where A062758(k) is the product of squares of divisors of k.A069150
Integers of the form k*k!/A062758(k) in the order they appear in A069149, where A062758(k) is the product of squares of divisors of k.
- Concatenations of consecutive primes, starting with 2, that are also prime.A069151
Concatenations of consecutive primes, starting with 2, that are also prime.
- a(n) = (n-1)!-n^tau(n)/n^2.A069152
a(n) = (n-1)!-n^tau(n)/n^2.
- a(n) = Sum_{d|n} d*(d-1)/2.A069153
a(n) = Sum_{d|n} d*(d-1)/2.
- Treated as strings, the concatenation c of the prime factors of n, in increasing order, is an initial segment of n. Equivalently, n begins with c.A069154
Treated as strings, the concatenation c of the prime factors of n, in increasing order, is an initial segment of n. Equivalently, n begins with c.
- Nonprime numbers k such that (k+1)*Sum_{d|k} 1/(d+1) is an integer.A069155
Nonprime numbers k such that (k+1)*Sum_{d|k} 1/(d+1) is an integer.
- A certain class of stable matchings.A069156
A certain class of stable matchings.
- Number of positive divisors of n that are divisible by the smallest prime that divides n.A069157
Number of positive divisors of n that are divisible by the smallest prime that divides n.
- a(n) = Product{d|n} mu(d), product over positive divisors, d, of n, where mu(d) = Moebius function (A008683).A069158
a(n) = Product{d|n} mu(d), product over positive divisors, d, of n, where mu(d) = Moebius function (A008683).
- a(n) = d(1) - d(2) + d(3) - d(4) + ... + (-1)^(n+1) d(n), where d(k) denotes the k-th term of the digit sequence 3, 1, 4, 1, 5, 9,.... of Pi.A069159
a(n) = d(1) - d(2) + d(3) - d(4) + ... + (-1)^(n+1) d(n), where d(k) denotes the k-th term of the digit sequence 3, 1, 4, 1, 5, 9,.... of Pi.
- Number of primes p such that n^2 < p < n^2 + pi(n), where pi(n) is the number of primes less than n.A069160
Number of primes p such that n^2 < p < n^2 + pi(n), where pi(n) is the number of primes less than n.