Sequences
392,541 sequences
- Numbers k such that the decimal expansion of the k-th Fibonacci number contains no pair of consecutive equal digits (probably finite).A050761
Numbers k such that the decimal expansion of the k-th Fibonacci number contains no pair of consecutive equal digits (probably finite).
- Fibonacci numbers containing no pair of consecutive equal digits (probably finite).A050762
Fibonacci numbers containing no pair of consecutive equal digits (probably finite).
- Numbers k such that the decimal expansion of k^k contains no pair of consecutive equal digits (probably finite).A050763
Numbers k such that the decimal expansion of k^k contains no pair of consecutive equal digits (probably finite).
- Numbers of form k^k (for values of k see A050763) containing no pair of consecutive equal digits (probably finite).A050764
Numbers of form k^k (for values of k see A050763) containing no pair of consecutive equal digits (probably finite).
- Composite n added to sum of its prime factors is nextprime(n).A050765
Composite n added to sum of its prime factors is nextprime(n).
- Primes occurring in A050765.A050766
Primes occurring in A050765.
- Let f(m) = smallest composite number that takes m steps of "add prime factors to number" to reach a prime and g(m) be the prime that is reached. Sequence gives values of g(m), sorted and duplicates removed.A050767
Let f(m) = smallest composite number that takes m steps of "add prime factors to number" to reach a prime and g(m) be the prime that is reached. Sequence gives values of g(m), sorted and duplicates removed.
- Iterated procedure 'composite k added to sum of its prime factors reaches a prime' yields 1 skipped prime.A050768
Iterated procedure 'composite k added to sum of its prime factors reaches a prime' yields 1 skipped prime.
- Iterated procedure 'composite k added to sum of its prime factors reaches a prime' yields 2 skipped primes.A050769
Iterated procedure 'composite k added to sum of its prime factors reaches a prime' yields 2 skipped primes.
- Iterated procedure 'composite k added to sum of its prime factors reaches a prime' yields 3 skipped primes.A050770
Iterated procedure 'composite k added to sum of its prime factors reaches a prime' yields 3 skipped primes.
- Iterated procedure 'composite k added to sum of its prime factors reaches a prime' yields 4 skipped primes.A050771
Iterated procedure 'composite k added to sum of its prime factors reaches a prime' yields 4 skipped primes.
- Iterated procedure 'composite k added to sum of its prime factors reaches a prime' yields 5 skipped primes.A050772
Iterated procedure 'composite k added to sum of its prime factors reaches a prime' yields 5 skipped primes.
- Iterated procedure 'composite k added to sum of its prime factors reaches a prime' yields 6 skipped primes.A050773
Iterated procedure 'composite k added to sum of its prime factors reaches a prime' yields 6 skipped primes.
- Iterated procedure 'composite k added to sum of its prime factors reaches a prime' yields 7 skipped primes.A050774
Iterated procedure 'composite k added to sum of its prime factors reaches a prime' yields 7 skipped primes.
- Iterated procedure 'composite k added to sum of its prime factors reaches a prime' yields 8 skipped primes.A050775
Iterated procedure 'composite k added to sum of its prime factors reaches a prime' yields 8 skipped primes.
- Iterated procedure 'composite k added to sum of its prime factors reaches a prime' yields 9 skipped primes.A050776
Iterated procedure 'composite k added to sum of its prime factors reaches a prime' yields 9 skipped primes.
- First occurrence from iterated procedure 'composite k added to sum of its prime factors reaches a prime' yielding n skipped primes.A050777
First occurrence from iterated procedure 'composite k added to sum of its prime factors reaches a prime' yielding n skipped primes.
- Primes that are ending primes after the iterated procedure of 'composite added to the sum of its prime factors reaches a prime'.A050778
Primes that are ending primes after the iterated procedure of 'composite added to the sum of its prime factors reaches a prime'.
- Primes that are not ending primes after the iterated procedure of 'composite added to the sum of its prime factors reaches a prime'.A050779
Primes that are not ending primes after the iterated procedure of 'composite added to the sum of its prime factors reaches a prime'.
- Numbers k such that sopfr(k) = sopfr(k + sopfr(k)).A050780
Numbers k such that sopfr(k) = sopfr(k + sopfr(k)).
- Numbers k such that sopfr(k) = sopfr(k - sopfr(k)).A050781
Numbers k such that sopfr(k) = sopfr(k - sopfr(k)).
- Smallest positive multiplier m such that m*n is palindromic (or zero if no such m exists).A050782
Smallest positive multiplier m such that m*n is palindromic (or zero if no such m exists).
- Palindromes containing no pair of consecutive equal digits.A050783
Palindromes containing no pair of consecutive equal digits.
- Palindromic primes containing no pair of consecutive equal digits.A050784
Palindromic primes containing no pair of consecutive equal digits.
- Palindromes containing at least one pair of consecutive equal digits.A050785
Palindromes containing at least one pair of consecutive equal digits.
- Palindromic primes containing at least one pair of consecutive equal digits.A050786
Palindromic primes containing at least one pair of consecutive equal digits.
- Consider the Diophantine equation x^3 + y^3 = z^3 - 1 (0 < x < y < z) or 'Fermat near misses'. Arrange solutions by increasing values of z. Sequence gives values of z.A050787
Consider the Diophantine equation x^3 + y^3 = z^3 - 1 (0 < x < y < z) or 'Fermat near misses'. Arrange solutions by increasing values of z. Sequence gives values of z.
- Consider the Diophantine equation x^3 + y^3 = z^3 - 1 (x < y < z) or 'Fermat near misses'. Arrange solutions by increasing values of z. Sequence gives values of x.A050788
Consider the Diophantine equation x^3 + y^3 = z^3 - 1 (x < y < z) or 'Fermat near misses'. Arrange solutions by increasing values of z. Sequence gives values of x.
- Consider the Diophantine equation x^3 + y^3 = z^3 - 1 (x < y < z) or 'Fermat near misses'. The values of z (see A050787) are arranged in monotonically increasing order. Sequence gives values of y.A050789
Consider the Diophantine equation x^3 + y^3 = z^3 - 1 (x < y < z) or 'Fermat near misses'. The values of z (see A050787) are arranged in monotonically increasing order. Sequence gives values of y.
- Consider the Diophantine equation x^3 + y^3 = z^3 - 1 (x < y < z) or 'Fermat near misses'. Arrange solutions by increasing values of z. Sequence gives values of x^3 + y^3 = z^3 - 1.A050790
Consider the Diophantine equation x^3 + y^3 = z^3 - 1 (x < y < z) or 'Fermat near misses'. Arrange solutions by increasing values of z. Sequence gives values of x^3 + y^3 = z^3 - 1.
- Consider the Diophantine equation x^3 + y^3 = z^3 + 1 (1 < x < y < z) or 'Fermat near misses'. Sequence gives values of z in monotonic increasing order.A050791
Consider the Diophantine equation x^3 + y^3 = z^3 + 1 (1 < x < y < z) or 'Fermat near misses'. Sequence gives values of z in monotonic increasing order.
- Consider the Diophantine equation x^3 + y^3 = z^3 + 1 (1 < x < y < z) or 'Fermat near misses'. Arrange solutions by increasing values of z (see A050791). Sequence gives values of x.A050792
Consider the Diophantine equation x^3 + y^3 = z^3 + 1 (1 < x < y < z) or 'Fermat near misses'. Arrange solutions by increasing values of z (see A050791). Sequence gives values of x.
- Consider the Diophantine equation x^3 + y^3 = z^3 + 1 (1<x<y<z) or 'Fermat near misses'. Arrange solutions by increasing values of z (see A050791), and increasing values of y in case of ties. Sequence gives values of y.A050793
Consider the Diophantine equation x^3 + y^3 = z^3 + 1 (1<x<y<z) or 'Fermat near misses'. Arrange solutions by increasing values of z (see A050791), and increasing values of y in case of ties. Sequence gives values of y.
- Consider the Diophantine equation x^3 + y^3 = z^3 + 1 (1 < x < y < z) or 'Fermat near misses'. Arrange solutions by increasing values of z (see A050791). Sequence gives values of x^3 + y^3 = z^3 + 1. For corresponding values of x, y, z see A050792, A050793, A050791 respectively.A050794
Consider the Diophantine equation x^3 + y^3 = z^3 + 1 (1 < x < y < z) or 'Fermat near misses'. Arrange solutions by increasing values of z (see A050791). Sequence gives values of x^3 + y^3 = z^3 + 1. For corresponding values of x, y, z see A050792, A050793, A050791 respectively.
- Numbers n such that n^2 - 1 is expressible as the sum of two nonzero squares in at least one way.A050795
Numbers n such that n^2 - 1 is expressible as the sum of two nonzero squares in at least one way.
- Numbers n such that n^2 + 1 is expressible as the sum of two nonzero squares in at least one way (the trivial solution n^2 + 1 = n^2 + 1^2 is not counted).A050796
Numbers n such that n^2 + 1 is expressible as the sum of two nonzero squares in at least one way (the trivial solution n^2 + 1 = n^2 + 1^2 is not counted).
- Numbers n such that n^2 - 1 is expressible as the sum of two nonzero squares in exactly one way.A050797
Numbers n such that n^2 - 1 is expressible as the sum of two nonzero squares in exactly one way.
- Numbers n such that m = n^2 + 1 is expressible as the sum of two nonzero squares in exactly two ways.A050798
Numbers n such that m = n^2 + 1 is expressible as the sum of two nonzero squares in exactly two ways.
- Values of n^2 - 1 resulting from A050795.A050799
Values of n^2 - 1 resulting from A050795.
- Values of n^2 + 1 resulting from A050796.A050800
Values of n^2 + 1 resulting from A050796.
- Numbers k such that k^2 is expressible as the sum of two positive cubes in at least one way.A050801
Numbers k such that k^2 is expressible as the sum of two positive cubes in at least one way.
- Squares expressible as the sum of two positive cubes in at least one way.A050802
Squares expressible as the sum of two positive cubes in at least one way.
- Cubes expressible as the sum of two nonzero squares in at least one way.A050803
Cubes expressible as the sum of two nonzero squares in at least one way.
- Numbers n such that n^3 is the sum of two nonzero squares in exactly one way.A050804
Numbers n such that n^3 is the sum of two nonzero squares in exactly one way.
- Inserting any digit between adjacent digits of prime p never yields another prime.A050805
Inserting any digit between adjacent digits of prime p never yields another prime.
- Inserting any digit between adjacent digits of prime p produces exactly 1 new prime.A050806
Inserting any digit between adjacent digits of prime p produces exactly 1 new prime.
- Increasing even numbers seen in decimal expansion of Pi (disregarding the decimal period) contiguous, smallest and distinct.A050807
Increasing even numbers seen in decimal expansion of Pi (disregarding the decimal period) contiguous, smallest and distinct.
- Numbers k such that floor(exp(k)) is prime.A050808
Numbers k such that floor(exp(k)) is prime.
- Primes of the form floor( exp(k) ).A050809
Primes of the form floor( exp(k) ).
- From sequence A050782, the n's corresponding to the first occurrence of m (or 0 if not defined).A050810
From sequence A050782, the n's corresponding to the first occurrence of m (or 0 if not defined).