Sequences
392,541 sequences
- RATS: Reverse Add Then Sort the digits applied to previous term, starting with 9.A066711
RATS: Reverse Add Then Sort the digits applied to previous term, starting with 9.
- Inverse of A032445, with first appearance of string "0" in decimal expansion of Pi added to A032445.A066712
Inverse of A032445, with first appearance of string "0" in decimal expansion of Pi added to A032445.
- RATS(2^n): Reverse Add the digits of 2^n, Then Sort: a(n) = A036839(2^n).A066713
RATS(2^n): Reverse Add the digits of 2^n, Then Sort: a(n) = A036839(2^n).
- Coordination sequence for ReO_3 net with respect to Re atom.A066714
Coordination sequence for ReO_3 net with respect to Re atom.
- a(n) = gcd(2n+1, sigma(2n+1)).A066715
a(n) = gcd(2n+1, sigma(2n+1)).
- Decimal expansion of the binary Champernowne constant 0.862240125868... whose binary expansion is the concatenation of 1, 2, 3, ... written in binary.A066716
Decimal expansion of the binary Champernowne constant 0.862240125868... whose binary expansion is the concatenation of 1, 2, 3, ... written in binary.
- The continued fraction for the "binary" Champernowne constant.A066717
The continued fraction for the "binary" Champernowne constant.
- Incrementally largest terms in the continued fraction for the "binary" Champernowne constant.A066718
Incrementally largest terms in the continued fraction for the "binary" Champernowne constant.
- Numbers k such that 1 + k^phi(k) is prime.A066719
Numbers k such that 1 + k^phi(k) is prime.
- The greedy rational packing sequence: a(1) = 1; for n > 1, a(n) is smallest number such that the ratios a(i)/a(j) for 1 <= i < j <= n are all distinct.A066720
The greedy rational packing sequence: a(1) = 1; for n > 1, a(n) is smallest number such that the ratios a(i)/a(j) for 1 <= i < j <= n are all distinct.
- Nonprimes in A066720.A066721
Nonprimes in A066720.
- Numbers that can be expressed as the sum of two primes in exactly six ways.A066722
Numbers that can be expressed as the sum of two primes in exactly six ways.
- Number of distinct partitions of n-th triangular number which can be obtained by merging parts in the partition 1+2+...+n.A066723
Number of distinct partitions of n-th triangular number which can be obtained by merging parts in the partition 1+2+...+n.
- a(1) = 1, a(2) = 2; for n > 1, a(n) is the least integer > a(n-1) such that the products a(i)*a(j) for 1 <= i < j <= n are all distinct.A066724
a(1) = 1, a(2) = 2; for n > 1, a(n) is the least integer > a(n-1) such that the products a(i)*a(j) for 1 <= i < j <= n are all distinct.
- Primes whose product of digits + 1 is also prime.A066725
Primes whose product of digits + 1 is also prime.
- Numbers n such that binomial(2n, n) - 1 is prime.A066726
Numbers n such that binomial(2n, n) - 1 is prime.
- Least factor of n^phi(n) - 1.A066727
Least factor of n^phi(n) - 1.
- a(n) is the number of integers of the form (n+k+n*k)/(n-k) for k = 1,2,...,n-1.A066728
a(n) is the number of integers of the form (n+k+n*k)/(n-k) for k = 1,2,...,n-1.
- a(n) = Product_{d|n, d<n} d if n is composite, n otherwise.A066729
a(n) = Product_{d|n, d<n} d if n is composite, n otherwise.
- Numbers with ever-increasing minimal-square-deniers.A066730
Numbers with ever-increasing minimal-square-deniers.
- f-triperfect numbers, where f(n) = sigma(n) and f-triperfect numbers are defined similarly to f-perfect numbers in A066218.A066731
f-triperfect numbers, where f(n) = sigma(n) and f-triperfect numbers are defined similarly to f-perfect numbers in A066218.
- Least k such that the least factor of k^Phi(k) -1 is the n-th prime.A066732
Least k such that the least factor of k^Phi(k) -1 is the n-th prime.
- Numbers such that the product of the digits of its square is a square > 0.A066733
Numbers such that the product of the digits of its square is a square > 0.
- Numbers such that the nonzero product of the digits of its 4th power is also a 4th power.A066734
Numbers such that the nonzero product of the digits of its 4th power is also a 4th power.
- Primes p dividing 1 + the product of the primes less than p.A066735
Primes p dividing 1 + the product of the primes less than p.
- Least number > 1 such that the nonzero product of the digits of its n-th power is also an n-th power.A066736
Least number > 1 such that the nonzero product of the digits of its n-th power is also an n-th power.
- Composite numbers that are concatenations of primes.A066737
Composite numbers that are concatenations of primes.
- Primes that are concatenations of nonprime numbers.A066738
Primes that are concatenations of nonprime numbers.
- Number of representations of n as a sum of products of positive integers. 1 is not allowed as a factor, unless it is the only factor. Representations which differ only in the order of terms or factors are considered equivalent.A066739
Number of representations of n as a sum of products of positive integers. 1 is not allowed as a factor, unless it is the only factor. Representations which differ only in the order of terms or factors are considered equivalent.
- Number of distinct partitions of A007504(n) which can be obtained by merging parts in the partition 2+3+5+...+prime(n), where prime(n) is the n-th prime.A066740
Number of distinct partitions of A007504(n) which can be obtained by merging parts in the partition 2+3+5+...+prime(n), where prime(n) is the n-th prime.
- Pentagonal numbers not divisible by 10 whose reverse is a square.A066741
Pentagonal numbers not divisible by 10 whose reverse is a square.
- Square numbers not divisible by 10 whose reverse is pentagonal.A066742
Square numbers not divisible by 10 whose reverse is pentagonal.
- a(n) is the number of integers of the form (n^2+1)/(k^2+1), where k = 1,2,3,...,n.A066743
a(n) is the number of integers of the form (n^2+1)/(k^2+1), where k = 1,2,3,...,n.
- a(n) = either 4a(n-1)+1 or 4a(n-1)+3 depending on corresponding term of A005614, +3 for 0, +1 for 1.A066744
a(n) = either 4a(n-1)+1 or 4a(n-1)+3 depending on corresponding term of A005614, +3 for 0, +1 for 1.
- Least number of applications of f(k) = k(k+1)+1 to n to yield a prime, if this number exists; -1 otherwise.A066745
Least number of applications of f(k) = k(k+1)+1 to n to yield a prime, if this number exists; -1 otherwise.
- Conjectured values of a(n) defined by a(n) = least number of applications of f(k) = k^2 + 1 to n to yield a prime, if this number exists; = -1 otherwise.A066746
Conjectured values of a(n) defined by a(n) = least number of applications of f(k) = k^2 + 1 to n to yield a prime, if this number exists; = -1 otherwise.
- Decimal expansion of the "binary" Copeland-Erdős constant 0.734121515408286120606...: concatenate primes in base two.A066747
Decimal expansion of the "binary" Copeland-Erdős constant 0.734121515408286120606...: concatenate primes in base two.
- The continued fraction for the "binary" Copeland-Erdős constant.A066748
The continued fraction for the "binary" Copeland-Erdős constant.
- List of primes p which are equal to a central binomial coefficient C(n,floor(n/2)) plus 1.A066749
List of primes p which are equal to a central binomial coefficient C(n,floor(n/2)) plus 1.
- Greatest common divisor of n and its digit sum.A066750
Greatest common divisor of n and its digit sum.
- Triangular numbers whose reverse is prime.A066751
Triangular numbers whose reverse is prime.
- a(n) = gcd(prime(n)+1, n+1).A066752
a(n) = gcd(prime(n)+1, n+1).
- a(n) = least natural number k such that n + Sum_{i=1..k} prime(i) is prime if such k exists; = 0 otherwise.A066753
a(n) = least natural number k such that n + Sum_{i=1..k} prime(i) is prime if such k exists; = 0 otherwise.
- Incrementally largest terms in the continued fraction for the "binary" Copeland-Erdos constant.A066754
Incrementally largest terms in the continued fraction for the "binary" Copeland-Erdos constant.
- Numbers m such that m^2 + 1 is not divisible by k^2 + 1 for any k in [1,m-1].A066755
Numbers m such that m^2 + 1 is not divisible by k^2 + 1 for any k in [1,m-1].
- Smallest number that requires n^3 steps to reach 1 in its Collatz trajectory (counting x/2 and 3x+1 steps).A066756
Smallest number that requires n^3 steps to reach 1 in its Collatz trajectory (counting x/2 and 3x+1 steps).
- Pentagonal numbers not divisible by 10 whose reverse is triangular.A066757
Pentagonal numbers not divisible by 10 whose reverse is triangular.
- Triangular numbers not divisible by 10 whose reverse is pentagonal.A066758
Triangular numbers not divisible by 10 whose reverse is pentagonal.
- a(n) = least multiple of n differing from a prime by at most 1, if such a multiple exists; = 0 otherwise.A066759
a(n) = least multiple of n differing from a prime by at most 1, if such a multiple exists; = 0 otherwise.
- a(n) = Sum_{1<=k<=n, k is not a divisor of n and k is not coprime to n} k.A066760
a(n) = Sum_{1<=k<=n, k is not a divisor of n and k is not coprime to n} k.