Sequences
392,541 sequences
- 3-apexes of omega: numbers k such that omega(k-3) < omega(k-2) < omega(k-1) < omega(k) > omega(k+1) > omega(k+2) > omega(k+3), where omega(m) = the number of distinct prime factors of m.A076761
3-apexes of omega: numbers k such that omega(k-3) < omega(k-2) < omega(k-1) < omega(k) > omega(k+1) > omega(k+2) > omega(k+3), where omega(m) = the number of distinct prime factors of m.
- 2-apexes of omega: numbers k such that omega(k-2) < omega(k-1) < omega(k) > omega(k+1) > omega(k+2), where omega(m) = the number of distinct prime factors of m.A076762
2-apexes of omega: numbers k such that omega(k-2) < omega(k-1) < omega(k) > omega(k+1) > omega(k+2), where omega(m) = the number of distinct prime factors of m.
- 1-apexes of omega: numbers n such that omega(n-1) < omega(n) > omega(n+1), where omega(m) = the number of distinct prime factors of m.A076763
1-apexes of omega: numbers n such that omega(n-1) < omega(n) > omega(n+1), where omega(m) = the number of distinct prime factors of m.
- n such that Omega(n-1) < Omega(n) < Omega(n+1), where Omega(m) = the number of prime factors of m, counting multiplicity.A076764
n such that Omega(n-1) < Omega(n) < Omega(n+1), where Omega(m) = the number of prime factors of m, counting multiplicity.
- Partial sums of Chebyshev sequence S(n,8) = U(n,4) = A001090(n+1).A076765
Partial sums of Chebyshev sequence S(n,8) = U(n,4) = A001090(n+1).
- Number of inequivalent binary linear codes of length n. Also the number of nonisomorphic binary matroids on an n-set.A076766
Number of inequivalent binary linear codes of length n. Also the number of nonisomorphic binary matroids on an n-set.
- Triangular numbers with square pyramidal indices.A076767
Triangular numbers with square pyramidal indices.
- Positive integers not expressible as the sum of a prime and a triangular number.A076768
Positive integers not expressible as the sum of a prime and a triangular number.
- Integers not expressible as the sum of a positive triangular number and a square.A076769
Integers not expressible as the sum of a positive triangular number and a square.
- Even numbers representable as the sum of two odd composites.A076770
Even numbers representable as the sum of two odd composites.
- Even numbers n representable as the sum of two non-coprime odd composites.A076771
Even numbers n representable as the sum of two non-coprime odd composites.
- Even numbers n representable as the sum of 2 coprime odd composites.A076772
Even numbers n representable as the sum of 2 coprime odd composites.
- 2-nadirs of phi: numbers k such that phi(k-2) > phi(k-1) > phi(k) < phi(k+1) < phi(k+2).A076773
2-nadirs of phi: numbers k such that phi(k-2) > phi(k-1) > phi(k) < phi(k+1) < phi(k+2).
- 2-nadirs of sigma: numbers k such that sigma(k-2) > sigma(k-1) > sigma(k) < sigma(k+1) < sigma(k+2).A076774
2-nadirs of sigma: numbers k such that sigma(k-2) > sigma(k-1) > sigma(k) < sigma(k+1) < sigma(k+2).
- Greatest common divisor of n and the binary representation of n interpreted decimally.A076775
Greatest common divisor of n and the binary representation of n interpreted decimally.
- a(0) = 1, a(1) = 2, a(2) = 5; for n > 2, a(n) = a(n-1)*a(n-2).A076776
a(0) = 1, a(1) = 2, a(2) = 5; for n > 2, a(n) = a(n-1)*a(n-2).
- Number of primes between successive Fibonacci numbers inclusive.A076777
Number of primes between successive Fibonacci numbers inclusive.
- 3-nadirs of Omega: numbers k such that Omega(k-3) > Omega(k-2) > Omega(k-1) > Omega(k) < Omega(k+1) < Omega(k+2) < Omega(k+3), where Omega(k) = number of prime factors of k, counting multiplicity.A076778
3-nadirs of Omega: numbers k such that Omega(k-3) > Omega(k-2) > Omega(k-1) > Omega(k) < Omega(k+1) < Omega(k+2) < Omega(k+3), where Omega(k) = number of prime factors of k, counting multiplicity.
- Maximum number of disjoint maximum-size antichains in partition lattice Par(n).A076779
Maximum number of disjoint maximum-size antichains in partition lattice Par(n).
- Let u(1)=u(2)=1, u(n)=(2^floor(u(n-1)/2)+1)/u(n-2) then a(n) = denominator of u(n).A076780
Let u(1)=u(2)=1, u(n)=(2^floor(u(n-1)/2)+1)/u(n-2) then a(n) = denominator of u(n).
- a(n) = 6^(n^2).A076781
a(n) = 6^(n^2).
- a(n) = 10^(n^2).A076782
a(n) = 10^(n^2).
- a(n) = 11^(n^2).A076783
a(n) = 11^(n^2).
- Let u(1)=u(2)=u(3)=1, u(n)=(2^floor(u(n-1)/2)+2^floor(u(n-2)/2)+1)/u(n-3) then a(n) = numerator of u(n).A076784
Let u(1)=u(2)=u(3)=1, u(n)=(2^floor(u(n-1)/2)+2^floor(u(n-2)/2)+1)/u(n-3) then a(n) = numerator of u(n).
- Let u(1)=u(2)=u(3)=1, u(n)=(2^floor(u(n-1)/2)+2^floor(u(n-2)/2)+1)/u(n-3) then a(n) = denominator of u(n).A076785
Let u(1)=u(2)=u(3)=1, u(n)=(2^floor(u(n-1)/2)+2^floor(u(n-2)/2)+1)/u(n-3) then a(n) = denominator of u(n).
- Squarefree numbers such that in decimal representation all their prefixes are also squarefree.A076786
Squarefree numbers such that in decimal representation all their prefixes are also squarefree.
- Pisumprimes: prime(k), where k is the sum of the first n digits of Pi.A076787
Pisumprimes: prime(k), where k is the sum of the first n digits of Pi.
- Decimal expansion of Sum_{m>=1} (1/(2^m*m^2)).A076788
Decimal expansion of Sum_{m>=1} (1/(2^m*m^2)).
- Phisumprimes: prime(k), where k is the sum of the first n digits of phi-1 and phi is the golden ratio.A076789
Phisumprimes: prime(k), where k is the sum of the first n digits of phi-1 and phi is the golden ratio.
- Interleave digits of Pi and phi-1 (golden section) starting with 3.A076790
Interleave digits of Pi and phi-1 (golden section) starting with 3.
- Triangle a(n,k) giving number of binary sequences of length n containing k subsequences 00.A076791
Triangle a(n,k) giving number of binary sequences of length n containing k subsequences 00.
- Sum_{d divides n} d^2*(-1)^bigomega(d), where bigomega(n) = A001222(n).A076792
Sum_{d divides n} d^2*(-1)^bigomega(d), where bigomega(n) = A001222(n).
- a(n) = Sum_{k=1..n} 2^prime(k).A076793
a(n) = Sum_{k=1..n} 2^prime(k).
- Numbers of the form Sum_{k=1..m} prime(r)^prime(k) for some values of m and r.A076794
Numbers of the form Sum_{k=1..m} prime(r)^prime(k) for some values of m and r.
- Partial sums of (2n-1)!!.A076795
Partial sums of (2n-1)!!.
- Greedy powers of Pi/4: Sum_{n>=1} (Pi/4)^a(n) = 1.A076796
Greedy powers of Pi/4: Sum_{n>=1} (Pi/4)^a(n) = 1.
- Greedy powers of (Pi/5): Sum_{n>=1} (Pi/5)^a(n) = 1.A076797
Greedy powers of (Pi/5): Sum_{n>=1} (Pi/5)^a(n) = 1.
- Greedy powers of (Pi/6): Sum_{n>=1} (Pi/6)^a(n) = 1.A076798
Greedy powers of (Pi/6): Sum_{n>=1} (Pi/6)^a(n) = 1.
- Greedy powers of (e/3): Sum_{n>=1} (e/3)^a(n) = 1.A076799
Greedy powers of (e/3): Sum_{n>=1} (e/3)^a(n) = 1.
- Greedy powers of (e/4): sum_{n=1..inf} (e/4)^a(n) = 1.A076800
Greedy powers of (e/4): sum_{n=1..inf} (e/4)^a(n) = 1.
- Greedy powers of (e/5): sum_{n=1..inf} (e/5)^a(n) = 1.A076801
Greedy powers of (e/5): sum_{n=1..inf} (e/5)^a(n) = 1.
- Greedy powers of the gamma constant (0.577215664...) Sum_{n=1..infinity} (gamma)^a(n) = 1.A076802
Greedy powers of the gamma constant (0.577215664...) Sum_{n=1..infinity} (gamma)^a(n) = 1.
- Smallest multiple of n which is a reverse concatenation of n nonnegative consecutive numbers, or 0 if no such multiple exists.A076803
Smallest multiple of n which is a reverse concatenation of n nonnegative consecutive numbers, or 0 if no such multiple exists.
- a(n) = least positive integer k satisfying Omega(k) = Omega(k+1)+Omega(k+2)....+Omega(k+n), where Omega = A001222 = number of prime factors, counting multiplicity.A076804
a(n) = least positive integer k satisfying Omega(k) = Omega(k+1)+Omega(k+2)....+Omega(k+n), where Omega = A001222 = number of prime factors, counting multiplicity.
- Triskaidekaphobic or 13-free primes: primes that do not contain the number 13.A076805
Triskaidekaphobic or 13-free primes: primes that do not contain the number 13.
- Minimal odd k such that k*2^n-1 and k*2^n+1 are twin primes.A076806
Minimal odd k such that k*2^n-1 and k*2^n+1 are twin primes.
- Number of n X n matrices over an alphabet of size 12.A076807
Number of n X n matrices over an alphabet of size 12.
- a(n) = 82n^3 - 1228n^2 + 6130n - 5861.A076808
a(n) = 82n^3 - 1228n^2 + 6130n - 5861.
- a(n) = n^4 + 853n^3 + 2636n^2 + 3536n + 1753.A076809
a(n) = n^4 + 853n^3 + 2636n^2 + 3536n + 1753.
- Least k such that k*n^n +/- 1 are twin primes.A076810
Least k such that k*n^n +/- 1 are twin primes.