Sequences
392,541 sequences
- Number of primes between n^2 and (n+1/3)^2.A089611
Number of primes between n^2 and (n+1/3)^2.
- a(n) = ((-1)^(n+1)*A002425(n)) modulo 5.A089612
a(n) = ((-1)^(n+1)*A002425(n)) modulo 5.
- "The partial sums of the positions where T occurs in this sentence are one, eight, twentyfive, fortynine, eightythree, onehundredtwentysix, ..." (Variation of Aronson's sequence).A089613
"The partial sums of the positions where T occurs in this sentence are one, eight, twentyfive, fortynine, eightythree, onehundredtwentysix, ..." (Variation of Aronson's sequence).
- Number of primes between n^2 and (n+1/4)^2.A089614
Number of primes between n^2 and (n+1/4)^2.
- Number of primes between n^2 and (n+1/5)^2.A089615
Number of primes between n^2 and (n+1/5)^2.
- Number of primes between n^2 and (n+1/6)^2.A089616
Number of primes between n^2 and (n+1/6)^2.
- Number of primes between n^2 and (n+1/7)^2.A089617
Number of primes between n^2 and (n+1/7)^2.
- Continued fraction elements constructed out of a van der Corput discrepancy sequence. Interpreted as such, it is the simple continued fraction of 0.461070495956719519354149869336699687678...A089618
Continued fraction elements constructed out of a van der Corput discrepancy sequence. Interpreted as such, it is the simple continued fraction of 0.461070495956719519354149869336699687678...
- a(n) = greatest prime factor of n^2 + (n+1)^2 for n >= 1.A089619
a(n) = greatest prime factor of n^2 + (n+1)^2 for n >= 1.
- a(n) = n^3 + prime(n).A089620
a(n) = n^3 + prime(n).
- n^4 + n-th prime.A089621
n^4 + n-th prime.
- a(n) = n^n + n-th prime.A089622
a(n) = n^n + n-th prime.
- Numbers n such that n^2 + 2n - 1 is prime.A089623
Numbers n such that n^2 + 2n - 1 is prime.
- Expansion of sqrt(2/Pi*EllipticK(4*sqrt(x))).A089624
Expansion of sqrt(2/Pi*EllipticK(4*sqrt(x))).
- Replace 2^k in binary expansion of n with (k+1)-st prime.A089625
Replace 2^k in binary expansion of n with (k+1)-st prime.
- a(n) = 1/h(n) where {h(n)} is the Hankel transform of {t(n)}; t(n) is defined by the expansion of tan(x)= Sum_n>0, t(n)*x^(2*n-1); |x|<Pi/2.A089626
a(n) = 1/h(n) where {h(n)} is the Hankel transform of {t(n)}; t(n) is defined by the expansion of tan(x)= Sum_n>0, t(n)*x^(2*n-1); |x|<Pi/2.
- T(n,k) = binomial(n,2*k)*binomial(2*k,k) for 0 <= k <= n, triangle read by rows.A089627
T(n,k) = binomial(n,2*k)*binomial(2*k,k) for 0 <= k <= n, triangle read by rows.
- Smallest member of a pair of consecutive twin prime pairs that have no primes between them.A089628
Smallest member of a pair of consecutive twin prime pairs that have no primes between them.
- Smallest member of a pair of consecutive twin prime pairs that have one prime between them.A089629
Smallest member of a pair of consecutive twin prime pairs that have one prime between them.
- Size of the smallest n-cluster.A089630
Size of the smallest n-cluster.
- a(n) = (Product_{p is a prime factor of n} p) mod (Product_{p is a prime factor of n} p-1).A089631
a(n) = (Product_{p is a prime factor of n} p) mod (Product_{p is a prime factor of n} p-1).
- 1 + product of prime factors of n is a perfect square.A089632
1 + product of prime factors of n is a perfect square.
- Numbers having no more than one 0 in their binary representation.A089633
Numbers having no more than one 0 in their binary representation.
- Smallest member of a pair of consecutive twin prime pairs that have two primes between them.A089634
Smallest member of a pair of consecutive twin prime pairs that have two primes between them.
- Smallest member of a pair of consecutive twin prime pairs that have three primes between them.A089635
Smallest member of a pair of consecutive twin prime pairs that have three primes between them.
- Least k, 1 <= k <= 2^n, such that the continued fraction for 2^n/k contains the maximum number of elements.A089636
Least k, 1 <= k <= 2^n, such that the continued fraction for 2^n/k contains the maximum number of elements.
- Smallest member of a pair of consecutive twin prime pairs that have exactly n primes between them.A089637
Smallest member of a pair of consecutive twin prime pairs that have exactly n primes between them.
- Numerator of (5/2)*Sum_{i=1..n} (-1)^(i-1)/(i^3*C(2*i,i)).A089638
Numerator of (5/2)*Sum_{i=1..n} (-1)^(i-1)/(i^3*C(2*i,i)).
- Denominator of (5/2)*Sum_{i=1..n} (-1)^(i-1)/(i^3*C(2*i,i)).A089639
Denominator of (5/2)*Sum_{i=1..n} (-1)^(i-1)/(i^3*C(2*i,i)).
- Enumeration of partial sums of 1 + [1,2] + [2,3] + [1,2] + [2,3] + ...A089640
Enumeration of partial sums of 1 + [1,2] + [2,3] + [1,2] + [2,3] + ...
- Number of k, 1<=k<=n, such that the number of elements in the continued fraction for n/k is maximum.A089641
Number of k, 1<=k<=n, such that the number of elements in the continued fraction for n/k is maximum.
- Numbers m such that there is a single k, 1 <= k <= m, such that the number of elements in the continued fraction for m/k is maximum.A089642
Numbers m such that there is a single k, 1 <= k <= m, such that the number of elements in the continued fraction for m/k is maximum.
- 3^a(n) divides C(3n,n); 3-adic valuation of A005809.A089643
3^a(n) divides C(3n,n); 3-adic valuation of A005809.
- Numbers k such that 7 divides the numerator of B(2*k) where B(k) = the k-th Bernoulli number.A089644
Numbers k such that 7 divides the numerator of B(2*k) where B(k) = the k-th Bernoulli number.
- Penny Flipping, or Flipping Coins: Given a stack of n coins, flip the top coin, then the stack of the top two coins, then the stack of the top three etc... starting again with the top coin after flipping all n coins. A flip of m coins reverses their order and inverts their state. This is the number of flips required to restore the stack to its original configuration.A089645
Penny Flipping, or Flipping Coins: Given a stack of n coins, flip the top coin, then the stack of the top two coins, then the stack of the top three etc... starting again with the top coin after flipping all n coins. A flip of m coins reverses their order and inverts their state. This is the number of flips required to restore the stack to its original configuration.
- a(n) = Sum(a(floor(n/p)): p prime and p<=n); a(1) = 1.A089646
a(n) = Sum(a(floor(n/p)): p prime and p<=n); a(1) = 1.
- Number of triangular partitions of n.A089647
Number of triangular partitions of n.
- Numbers whose numbers of zeros and ones in binary representation differ at most by 1.A089648
Numbers whose numbers of zeros and ones in binary representation differ at most by 1.
- a(1)=1, a(2)=2, a(n) = a(n-1) + a(floor((n+1)/3)).A089649
a(1)=1, a(2)=2, a(n) = a(n-1) + a(floor((n+1)/3)).
- a(n) = A089649(n) mod 3.A089650
a(n) = A089649(n) mod 3.
- Partial sums of the sequence : a(1)=1, a(1), a(1), a(1), a(1), a(2), a(2), a(2), a(2), a(3), a(3), a(3), a(3), a(4), ... each term (not a(1)) repeated 4 times.A089651
Partial sums of the sequence : a(1)=1, a(1), a(1), a(1), a(1), a(2), a(2), a(2), a(2), a(3), a(3), a(3), a(3), a(4), ... each term (not a(1)) repeated 4 times.
- Partial sums, modulo 4, of the sequence: a(1)=1, a(1), a(1), a(1), a(1), a(2), a(2), a(2), a(2), a(3), a(3), a(3), a(3), a(4), ... each term (not a(1)) repeated 4 times.A089652
Partial sums, modulo 4, of the sequence: a(1)=1, a(1), a(1), a(1), a(1), a(2), a(2), a(2), a(2), a(3), a(3), a(3), a(3), a(4), ... each term (not a(1)) repeated 4 times.
- Numbers k > 1 such that (product of prime factors of k) - 1 is a perfect square.A089653
Numbers k > 1 such that (product of prime factors of k) - 1 is a perfect square.
- Table T(n,k), read by rows, related to a conjecture of P. Erdos (see A039669).A089654
Table T(n,k), read by rows, related to a conjecture of P. Erdos (see A039669).
- a(1)=1 and for n>=2 a(n) is the denominator of A(n) (see comment for A(n) definition).A089655
a(1)=1 and for n>=2 a(n) is the denominator of A(n) (see comment for A(n) definition).
- Given a distribution of n balls, labeled 1,...,n, among n unlabeled contents-ordered urns, arrange the nonempty urns in increasing order of their initial elements: U_1,...U_k and sum the quantities (i-1)(card U_i - 1) for i=1,...,k to get the "weight" of this distribution. These numbers represent the number of distributions of even weight minus the number with odd weight.A089656
Given a distribution of n balls, labeled 1,...,n, among n unlabeled contents-ordered urns, arrange the nonempty urns in increasing order of their initial elements: U_1,...U_k and sum the quantities (i-1)(card U_i - 1) for i=1,...,k to get the "weight" of this distribution. These numbers represent the number of distributions of even weight minus the number with odd weight.
- Let g[n]=Floor[Prime[n]-n)/((n-PrimePi[n])], then a(n) = Floor[(Prime[n]+g[n]*PrimePi[n])/(1+g[n]).A089657
Let g[n]=Floor[Prime[n]-n)/((n-PrimePi[n])], then a(n) = Floor[(Prime[n]+g[n]*PrimePi[n])/(1+g[n]).
- a(n) = S1(n,1), where S1(n, t) = Sum_{k=0..n} (k^t * Sum_{j=0..k} binomial(n,j)).A089658
a(n) = S1(n,1), where S1(n, t) = Sum_{k=0..n} (k^t * Sum_{j=0..k} binomial(n,j)).
- a(n) = S1(n,2), where S1(n, t) = Sum_{k=0..n} (k^t * Sum_{j=0..k} binomial(n,j)).A089659
a(n) = S1(n,2), where S1(n, t) = Sum_{k=0..n} (k^t * Sum_{j=0..k} binomial(n,j)).
- a(n) = S1(n,3), where S1(n, t) = Sum_{k=0..n} (k^t * Sum_{j=0..k} binomial(n,j)).A089660
a(n) = S1(n,3), where S1(n, t) = Sum_{k=0..n} (k^t * Sum_{j=0..k} binomial(n,j)).