Sequences
392,541 sequences
- Positive numbers of the form y^2 - x^3, x and y >= 1.A080761
Positive numbers of the form y^2 - x^3, x and y >= 1.
- Positive numbers not of the form y^2 - x^3, x and y >= 1.A080762
Positive numbers not of the form y^2 - x^3, x and y >= 1.
- Exchange 1's and 2's in the eta-sequence A006337.A080763
Exchange 1's and 2's in the eta-sequence A006337.
- First differences of A049472, floor(n/sqrt(2)).A080764
First differences of A049472, floor(n/sqrt(2)).
- Integers m such that m+1 divides lcm(1 through m).A080765
Integers m such that m+1 divides lcm(1 through m).
- A unitary phi reciprocal amicable number: consider two different numbers r, s which satisfy the following equation for some integer k: uphi(r) = uphi(s) = (1/k) * r * s / (r-s); or equivalently, 1/uphi(r) = 1/uphi(s) = k * (1/s - 1/r); sequence gives r numbers.A080766
A unitary phi reciprocal amicable number: consider two different numbers r, s which satisfy the following equation for some integer k: uphi(r) = uphi(s) = (1/k) * r * s / (r-s); or equivalently, 1/uphi(r) = 1/uphi(s) = k * (1/s - 1/r); sequence gives r numbers.
- A unitary phi reciprocal amicable number: consider two different numbers r, s which satisfy the following equation for some integer k: uphi(r) = uphi(s) = (1/k) * r * s / (r-s); or equivalently, 1/uphi(r) = 1/uphi(s) = k * (1/s - 1/r); sequence gives s numbers.A080767
A unitary phi reciprocal amicable number: consider two different numbers r, s which satisfy the following equation for some integer k: uphi(r) = uphi(s) = (1/k) * r * s / (r-s); or equivalently, 1/uphi(r) = 1/uphi(s) = k * (1/s - 1/r); sequence gives s numbers.
- A unitary phi reciprocal amicable number: consider two different numbers r, s which satisfy the following equation for some integer k: uphi(r) = uphi(s) = (1/k) * r * s / (r-s); or equivalently, 1/uphi(r) = 1/uphi(s) = k * (1/s - 1/r); sequence gives k numbers.A080768
A unitary phi reciprocal amicable number: consider two different numbers r, s which satisfy the following equation for some integer k: uphi(r) = uphi(s) = (1/k) * r * s / (r-s); or equivalently, 1/uphi(r) = 1/uphi(s) = k * (1/s - 1/r); sequence gives k numbers.
- Number of primes between consecutive integer powers with exponent > 1.A080769
Number of primes between consecutive integer powers with exponent > 1.
- a(n) = floor(e*(n+3)!) - (n+3)*(n+2)*(n+1)*n*floor(e*(n-1)!).A080770
a(n) = floor(e*(n+3)!) - (n+3)*(n+2)*(n+1)*n*floor(e*(n-1)!).
- Duplicate of A025477.A080771
Duplicate of A025477.
- Numbers of numbers <= n having prime factors <= k, triangular array read by rows.A080772
Numbers of numbers <= n having prime factors <= k, triangular array read by rows.
- In binary representation: sum of number of 1's in prime factors of n (with repetition).A080773
In binary representation: sum of number of 1's in prime factors of n (with repetition).
- Numbers with two prime factors: (4*i+1)*(4*j+3).A080774
Numbers with two prime factors: (4*i+1)*(4*j+3).
- Number of n X n monomial matrices whose nonzero entries are unit Hurwitz quaternions.A080775
Number of n X n monomial matrices whose nonzero entries are unit Hurwitz quaternions.
- Oscillating sequence which rises to 2^(k-1) in k-th segment (k>=1) then falls back to 0.A080776
Oscillating sequence which rises to 2^(k-1) in k-th segment (k>=1) then falls back to 0.
- a(n), when spelled in English, is the smallest positive integer with exactly n letters.A080777
a(n), when spelled in English, is the smallest positive integer with exactly n letters.
- Double factorial primes; values k for which k!! + 1 is prime.A080778
Double factorial primes; values k for which k!! + 1 is prime.
- Triangle read by rows: n-th row gives expansion of the series for HarmonicNumber(n, -r).A080779
Triangle read by rows: n-th row gives expansion of the series for HarmonicNumber(n, -r).
- a(1)=2; for n > 1, a(n) is the smallest integer greater than a(n-1) consistent with the condition "n is in the sequence if and only if a(n) is congruent to 0 (mod 6)".A080780
a(1)=2; for n > 1, a(n) is the smallest integer greater than a(n-1) consistent with the condition "n is in the sequence if and only if a(n) is congruent to 0 (mod 6)".
- Duplicate of A079357.A080781
Duplicate of A079357.
- a(1)=1, a(n)=a(n-1)-1 if n is already in the sequence, a(n)=a(n-1)+2 otherwise.A080782
a(1)=1, a(n)=a(n-1)-1 if n is already in the sequence, a(n)=a(n-1)+2 otherwise.
- a(1)=1, a(n)=a(n-1)-1 if n is already in the sequence, a(n)=a(n-1)+5 otherwise.A080783
a(1)=1, a(n)=a(n-1)-1 if n is already in the sequence, a(n)=a(n-1)+5 otherwise.
- Duplicate of A072978.A080784
Duplicate of A072978.
- Least p-smooth number not less than n, where p is the smallest prime factor of n.A080785
Least p-smooth number not less than n, where p is the smallest prime factor of n.
- Triangle T(n,k) = number of k-smooth numbers <= n, read by rows.A080786
Triangle T(n,k) = number of k-smooth numbers <= n, read by rows.
- a(1)=a(2)=1; a(n) = a(n-1) + last decimal digit of a(n-2).A080787
a(1)=a(2)=1; a(n) = a(n-1) + last decimal digit of a(n-2).
- Primes that are still primes when turned upsided down.A080788
Primes that are still primes when turned upsided down.
- Numbers that are primes when turned upside down.A080789
Numbers that are primes when turned upside down.
- Binary emirps, primes whose binary reversal is a different prime.A080790
Binary emirps, primes whose binary reversal is a different prime.
- Number of nonleading 0's in binary expansion of n.A080791
Number of nonleading 0's in binary expansion of n.
- Numbers which when seen in a mirror are different numbers.A080792
Numbers which when seen in a mirror are different numbers.
- Starting with a(0) = 1, smallest number k > a(n-1) such that, for all a(m) with m < n, k + a(m) is not squarefree.A080793
Starting with a(0) = 1, smallest number k > a(n-1) such that, for all a(m) with m < n, k + a(m) is not squarefree.
- Numbers k whose digits are all contained, in any order, within the digits of prime(k).A080794
Numbers k whose digits are all contained, in any order, within the digits of prime(k).
- Number of minimax trees on n nodes.A080795
Number of minimax trees on n nodes.
- Weight enumerator of third-order Reed-Muller code RM(3,10) of length 1024.A080796
Weight enumerator of third-order Reed-Muller code RM(3,10) of length 1024.
- Starting with a(0)=5, a(n) = smallest squarefree number k such that, for all a(m) with m<n, k+a(m) is not squarefree.A080797
Starting with a(0)=5, a(n) = smallest squarefree number k such that, for all a(m) with m<n, k+a(m) is not squarefree.
- Largest prime factor of 3^n-2.A080798
Largest prime factor of 3^n-2.
- Number of divide by 2 and add 1 operations required to reach ...,7,8,4,2,1 when started at n.A080799
Number of divide by 2 and add 1 operations required to reach ...,7,8,4,2,1 when started at n.
- Similar to A080799 but count only division steps.A080800
Similar to A080799 but count only division steps.
- Similar to A080799 but count only addition steps.A080801
Similar to A080799 but count only addition steps.
- Smaller of the two factors of the n-th semiprime number of the form m!-1.A080802
Smaller of the two factors of the n-th semiprime number of the form m!-1.
- Number of vertices of minimal graph with an automorphism group of order n.A080803
Number of vertices of minimal graph with an automorphism group of order n.
- Least number of connected subgraphs of the binary cube GF(2)^n such that every vertex of GF(2)^n lies in at least one of the subgraphs and no two vertices lie in the same set of subgraphs (such a collection is called an identifying set).A080804
Least number of connected subgraphs of the binary cube GF(2)^n such that every vertex of GF(2)^n lies in at least one of the subgraphs and no two vertices lie in the same set of subgraphs (such a collection is called an identifying set).
- Numbers n such that A072475(n) divides A071221(n).A080805
Numbers n such that A072475(n) divides A071221(n).
- Positive integer values of n such that 6*n^2-5 is a square.A080806
Positive integer values of n such that 6*n^2-5 is a square.
- a(1) = 3, a(n)= smallest n-th power obtained by inserting digits anywhere in a(n-1).A080807
a(1) = 3, a(n)= smallest n-th power obtained by inserting digits anywhere in a(n-1).
- a(1) = 4, a(n)= smallest n-th power obtained by inserting digits anywhere in a(n-1).A080808
a(1) = 4, a(n)= smallest n-th power obtained by inserting digits anywhere in a(n-1).
- a(1) = 6; thereafter, a(n)= smallest n-th power obtained by inserting digits anywhere in a(n-1).A080809
a(1) = 6; thereafter, a(n)= smallest n-th power obtained by inserting digits anywhere in a(n-1).
- a(1) = 7, a(n)= smallest n-th power obtained by inserting digits anywhere in a(n-1).A080810
a(1) = 7, a(n)= smallest n-th power obtained by inserting digits anywhere in a(n-1).