Sequences
392,541 sequences
- Numbers n such that 2*n+1 or n itself is prime.A079111
Numbers n such that 2*n+1 or n itself is prime.
- Numbers in binary representation with odd length.A079112
Numbers in binary representation with odd length.
- Number of 3's in n# (n primorial) = 3's in A002110(n).A079113
Number of 3's in n# (n primorial) = 3's in A002110(n).
- Least squarefree number > n that is coprime to n.A079114
Least squarefree number > n that is coprime to n.
- Least k such that n+k is squarefree and coprime to n.A079115
Least k such that n+k is squarefree and coprime to n.
- a(n) = floor(1/(n-1) * Sum_{k=1..n-1} a(k)^(n/k)), given a(0)=1, a(1)=2, a(2)=3.A079116
a(n) = floor(1/(n-1) * Sum_{k=1..n-1} a(k)^(n/k)), given a(0)=1, a(1)=2, a(2)=3.
- a(n) = floor(1/(n-1) * Sum_{k=1..n-1} a(k)^(n/k)), given a(0)=1, a(1)=2, a(2)=5.A079117
a(n) = floor(1/(n-1) * Sum_{k=1..n-1} a(k)^(n/k)), given a(0)=1, a(1)=2, a(2)=5.
- a(n) = floor(1/(n-1) * Sum_{k=1..n-1} a(k)^(n/k)), given a(0)=1, a(1)=2, a(2)=6.A079118
a(n) = floor(1/(n-1) * Sum_{k=1..n-1} a(k)^(n/k)), given a(0)=1, a(1)=2, a(2)=6.
- a(n) = floor(1/(n-1) * Sum_{k=1..n-1} a(k)^(n/k)), given a(0)=1, a(1)=2, a(2)=7.A079119
a(n) = floor(1/(n-1) * Sum_{k=1..n-1} a(k)^(n/k)), given a(0)=1, a(1)=2, a(2)=7.
- a(n) = floor(1/(n-1) * Sum_{k=1..n-1} a(k)^(n/k)), given a(0)=1, a(1)=3, a(2)=7.A079120
a(n) = floor(1/(n-1) * Sum_{k=1..n-1} a(k)^(n/k)), given a(0)=1, a(1)=3, a(2)=7.
- a(n+1) = floor((1/n)*(Sum_{k=1..n} a(k)^((n+1)/k))), given a(0)=1, a(1)=3, a(2)=8.A079121
a(n+1) = floor((1/n)*(Sum_{k=1..n} a(k)^((n+1)/k))), given a(0)=1, a(1)=3, a(2)=8.
- Number of ways to partition 2*n into distinct positive integers not greater than n.A079122
Number of ways to partition 2*n into distinct positive integers not greater than n.
- Number of 4's in n# (n primorial) = 4's in A002110(n).A079123
Number of 4's in n# (n primorial) = 4's in A002110(n).
- Number of ways to partition n into distinct positive integers <= phi(n), where phi is Euler's totient function (A000010).A079124
Number of ways to partition n into distinct positive integers <= phi(n), where phi is Euler's totient function (A000010).
- Number of ways to partition the sum of all divisors of n (sigma(n), A000203) into distinct positive integers not greater than n.A079125
Number of ways to partition the sum of all divisors of n (sigma(n), A000203) into distinct positive integers not greater than n.
- Triangle T(n,k) of numbers of partitions of n into distinct positive integers <= k, 0<=k<=n.A079126
Triangle T(n,k) of numbers of partitions of n into distinct positive integers <= k, 0<=k<=n.
- Number of 5's in n# (n primorial).A079127
Number of 5's in n# (n primorial).
- Number of degree-n permutations with (mutually) relatively prime cycle lengths.A079128
Number of degree-n permutations with (mutually) relatively prime cycle lengths.
- Number of degree-n permutations with pairwise coprime cycle lengths.A079129
Number of degree-n permutations with pairwise coprime cycle lengths.
- Primes such that iterated sum-of-digits (A038194) is a square.A079130
Primes such that iterated sum-of-digits (A038194) is a square.
- Primes such that iterated sum-of-digits (A038194) is odd.A079131
Primes such that iterated sum-of-digits (A038194) is odd.
- Primes such that iterated sum-of-digits (A038194) is even.A079132
Primes such that iterated sum-of-digits (A038194) is even.
- Number of 6's in n# (n primorial) = 6's in A002110(n).A079133
Number of 6's in n# (n primorial) = 6's in A002110(n).
- Number of 8's in n# (n primorial) = 8's in A002110(n).A079134
Number of 8's in n# (n primorial) = 8's in A002110(n).
- Number of 7's in n# (n primorial) = 7's in A002110(n).A079135
Number of 7's in n# (n primorial) = 7's in A002110(n).
- Positions of 0 in the repetition-resistant sequence A079101.A079136
Positions of 0 in the repetition-resistant sequence A079101.
- Number of (undirected) Hamiltonian paths on the 4 X n knight graph.A079137
Number of (undirected) Hamiltonian paths on the 4 X n knight graph.
- Primes of the form k^2 + 7.A079138
Primes of the form k^2 + 7.
- Numbers n such that (Product of first n twin prime pair averages [A014574] ) + 1 is prime.A079139
Numbers n such that (Product of first n twin prime pair averages [A014574] ) + 1 is prime.
- Numbers n such that (Product of first n twin prime pair averages [A014574]) - 1 is prime.A079140
Numbers n such that (Product of first n twin prime pair averages [A014574]) - 1 is prime.
- Primes of the form p^2 + 6 where p is prime.A079141
Primes of the form p^2 + 6 where p is prime.
- Numbers divisible by prime integer parts of their square roots.A079142
Numbers divisible by prime integer parts of their square roots.
- Numbers divisible by prime ceilings of their square roots + 1.A079143
Numbers divisible by prime ceilings of their square roots + 1.
- Number of labeled interval orders on n elements: (2+2)-free posets.A079144
Number of labeled interval orders on n elements: (2+2)-free posets.
- Number of labeled semitransitive orders on n elements: (1+3)-free posets.A079145
Number of labeled semitransitive orders on n elements: (1+3)-free posets.
- Number of unlabeled semitransitive orders on n elements: (1+3)-free posets.A079146
Number of unlabeled semitransitive orders on n elements: (1+3)-free posets.
- Primes p such that p+1 has at most 2 prime factors, counted with multiplicity; i.e., primes p such that bigomega(p+1) = A001222(p+1) <= 2.A079147
Primes p such that p+1 has at most 2 prime factors, counted with multiplicity; i.e., primes p such that bigomega(p+1) = A001222(p+1) <= 2.
- Primes p such that p-1 has at most 2 prime factors, counted with multiplicity; i.e., primes p such that bigomega(p-1) = A001222(p-1) <= 2.A079148
Primes p such that p-1 has at most 2 prime factors, counted with multiplicity; i.e., primes p such that bigomega(p-1) = A001222(p-1) <= 2.
- Primes p such that either p-1 or p+1 has at most 2 prime factors, counted with multiplicity; i.e., primes p such that either bigomega(p-1) <= 2 or bigomega(p+1) <= 2, where bigomega(n) = A001222(n).A079149
Primes p such that either p-1 or p+1 has at most 2 prime factors, counted with multiplicity; i.e., primes p such that either bigomega(p-1) <= 2 or bigomega(p+1) <= 2, where bigomega(n) = A001222(n).
- Primes p such that p+1 has at most 3 prime factors, counted with multiplicity; i.e., primes p such that bigomega(p+1) = A001222(p+1) <= 3.A079150
Primes p such that p+1 has at most 3 prime factors, counted with multiplicity; i.e., primes p such that bigomega(p+1) = A001222(p+1) <= 3.
- Primes p such that p-1 has at most 3 prime factors, counted with multiplicity; i.e., primes p such that bigomega(p-1) = A001222(p-1) <= 3.A079151
Primes p such that p-1 has at most 3 prime factors, counted with multiplicity; i.e., primes p such that bigomega(p-1) = A001222(p-1) <= 3.
- Primes p such that either p-1 or p+1 has at most 3 prime factors, counted with multiplicity; i.e., primes p such that either bigomega(p-1) <= 3 or bigomega(p+1) <= 3, where bigomega(n) = A001222(n).A079152
Primes p such that either p-1 or p+1 has at most 3 prime factors, counted with multiplicity; i.e., primes p such that either bigomega(p-1) <= 3 or bigomega(p+1) <= 3, where bigomega(n) = A001222(n).
- Primes p such that both p-1 and p+1 have at most 3 prime factors, counted with multiplicity; i.e., primes p such that bigomega(p-1) <= 3 and bigomega(p+1) <= 3, where bigomega(n) = A001222(n).A079153
Primes p such that both p-1 and p+1 have at most 3 prime factors, counted with multiplicity; i.e., primes p such that bigomega(p-1) <= 3 and bigomega(p+1) <= 3, where bigomega(n) = A001222(n).
- Numbers k such that reverse(A004154(k)) - 1 is prime.A079154
Numbers k such that reverse(A004154(k)) - 1 is prime.
- The number of primes less than 10^n whose digital root (A038194) is also prime.A079155
The number of primes less than 10^n whose digital root (A038194) is also prime.
- Sum of end-to-end Manhattan distances over all self-avoiding n-step walks on cubic lattice. Numerator of mean Manhattan displacement s(n)=a(n)/A078717.A079156
Sum of end-to-end Manhattan distances over all self-avoiding n-step walks on cubic lattice. Numerator of mean Manhattan displacement s(n)=a(n)/A078717.
- Sum of square displacements over all self-avoiding walks on cubic lattice trapped after n steps. Numerator of mean square displacement a(n)/A077817(n).A079157
Sum of square displacements over all self-avoiding walks on cubic lattice trapped after n steps. Numerator of mean square displacement a(n)/A077817(n).
- Sum of end-to-end Manhattan distances over all self-avoiding walks on cubic lattice trapped after n steps.A079158
Sum of end-to-end Manhattan distances over all self-avoiding walks on cubic lattice trapped after n steps.
- {a(n)} = sequence of smallest positive integers such that sqrt(1 + Sum_{n>=1} a(n)*p_n*x^n) = A079160(x), a power series also having positive integer coefficients, where p_n is the n-th prime.A079159
{a(n)} = sequence of smallest positive integers such that sqrt(1 + Sum_{n>=1} a(n)*p_n*x^n) = A079160(x), a power series also having positive integer coefficients, where p_n is the n-th prime.
- Satisfies A(x)^2 = (1 + Sum_{n>=1} A079159(n)*p_n*x^n) = A079161(x), where p_n is the n-th prime.A079160
Satisfies A(x)^2 = (1 + Sum_{n>=1} A079159(n)*p_n*x^n) = A079161(x), where p_n is the n-th prime.