Sequences
392,541 sequences
- G.f. satisfies: A(x) = A(x^2) + x*A(x^2)^2.A073711
G.f. satisfies: A(x) = A(x^2) + x*A(x^2)^2.
- Self-convolution of A073711.A073712
Self-convolution of A073711.
- Numbers k such that the number of distinct primes dividing k = number of anti-divisors of k.A073713
Numbers k such that the number of distinct primes dividing k = number of anti-divisors of k.
- Table, read by antidiagonals, generated by successive convolutions of the first row such that the first row equals the same table in this flattened form.A073714
Table, read by antidiagonals, generated by successive convolutions of the first row such that the first row equals the same table in this flattened form.
- Prime preceding the n-th Mersenne prime.A073715
Prime preceding the n-th Mersenne prime.
- Numbers n such that the number of prime divisors of n (counted with multiplicity) = number of anti-divisors of n.A073716
Numbers n such that the number of prime divisors of n (counted with multiplicity) = number of anti-divisors of n.
- a(n) = T(2n+1), where T(n) are the tribonacci numbers A000073.A073717
a(n) = T(2n+1), where T(n) are the tribonacci numbers A000073.
- Powers of 2 with composite exponents.A073718
Powers of 2 with composite exponents.
- a(n) = floor(prime(2^n)/composite(2^n)).A073719
a(n) = floor(prime(2^n)/composite(2^n)).
- Let b(1) = 1, b(k+1) = b(k) - k*trunc(k/b(k)+1), where trunc(x) = floor(x) if x>= 0, trunc(x) = ceiling(x) otherwise. Sequence a(n) gives the successive absolute values taken by b(k).A073720
Let b(1) = 1, b(k+1) = b(k) - k*trunc(k/b(k)+1), where trunc(x) = floor(x) if x>= 0, trunc(x) = ceiling(x) otherwise. Sequence a(n) gives the successive absolute values taken by b(k).
- Numbers k such that PrimePi(k) divides sigma(k).A073721
Numbers k such that PrimePi(k) divides sigma(k).
- Least k such that sigma(k) mod primepi(k) = n or zero if no such number exists.A073722
Least k such that sigma(k) mod primepi(k) = n or zero if no such number exists.
- Numbers k such that sigma(k) mod pi(k) = 1.A073723
Numbers k such that sigma(k) mod pi(k) = 1.
- a(n) = (4^(n+1) + 6n + 5)/9.A073724
a(n) = (4^(n+1) + 6n + 5)/9.
- a(n)-th composite number = phi(n-th composite number); a(1)=a(2)=0.A073725
a(n)-th composite number = phi(n-th composite number); a(1)=a(2)=0.
- Primitive irreducible trinomials: x^n + x^k + 1 is a primitive irreducible polynomial (mod 2) for some k with 0 < k < n.A073726
Primitive irreducible trinomials: x^n + x^k + 1 is a primitive irreducible polynomial (mod 2) for some k with 0 < k < n.
- Number of distinct-digit integers between squares.A073727
Number of distinct-digit integers between squares.
- a(n) = Sum_{k=0..n} S(k), where S(n) are the tribonacci generalized numbers A001644.A073728
a(n) = Sum_{k=0..n} S(k), where S(n) are the tribonacci generalized numbers A001644.
- Concatenation of initial and final digits of n in decimal representation.A073729
Concatenation of initial and final digits of n in decimal representation.
- Concatenation of largest and smallest digits of n in decimal representation.A073730
Concatenation of largest and smallest digits of n in decimal representation.
- Least k such that A073729(k) = n.A073731
Least k such that A073729(k) = n.
- Decimal expansion of lim_{n -> infinity} n*phi - Sum_{k=1..n} F(k+1)/F(k), where phi is the golden ratio and F(k) denotes the k-th Fibonacci number.A073732
Decimal expansion of lim_{n -> infinity} n*phi - Sum_{k=1..n} F(k+1)/F(k), where phi is the golden ratio and F(k) denotes the k-th Fibonacci number.
- Numerators of convergents to log_2(10).A073733
Numerators of convergents to log_2(10).
- GCD of consecutive members of the EKG sequence A064413.A073734
GCD of consecutive members of the EKG sequence A064413.
- Numbers k such that the k-th term of the EKG sequence (A064413(k)) has more than one controlling prime.A073735
Numbers k such that the k-th term of the EKG sequence (A064413(k)) has more than one controlling prime.
- Sum of primes whose index is congruent to n (mod 3); equals the partial sums of A073737 (in which sums of three successive terms form the primes).A073736
Sum of primes whose index is congruent to n (mod 3); equals the partial sums of A073737 (in which sums of three successive terms form the primes).
- Sums of three successive terms form the odd primes.A073737
Sums of three successive terms form the odd primes.
- Sum of every other prime <= n-th prime down to 2 or 1; equals the partial sums of A036467 (in which sums of two consecutive terms form the primes).A073738
Sum of every other prime <= n-th prime down to 2 or 1; equals the partial sums of A036467 (in which sums of two consecutive terms form the primes).
- Least positive integers whose convolution forms a sequence whose odd-indexed terms are twice the odd primes (see: A073740).A073739
Least positive integers whose convolution forms a sequence whose odd-indexed terms are twice the odd primes (see: A073740).
- Self-convolution of A073739; odd-indexed terms are twice the odd primes.A073740
Self-convolution of A073739; odd-indexed terms are twice the odd primes.
- Number of steps needed to reach a prime when the following map is repeatedly applied to n: if n is even then 2n+1, otherwise 2n-1; or -1 if no prime is ever reached.A073741
Number of steps needed to reach a prime when the following map is repeatedly applied to n: if n is even then 2n+1, otherwise 2n-1; or -1 if no prime is ever reached.
- Decimal expansion of sinh(1).A073742
Decimal expansion of sinh(1).
- Decimal expansion of cosh(1).A073743
Decimal expansion of cosh(1).
- Decimal expansion of tanh(1).A073744
Decimal expansion of tanh(1).
- Decimal expansion of csch(1).A073745
Decimal expansion of csch(1).
- Decimal expansion of sech(1).A073746
Decimal expansion of sech(1).
- Decimal expansion of coth(1).A073747
Decimal expansion of coth(1).
- a(n) = S(n)*S(n-1), where S(n) are the generalized tribonacci numbers A001644.A073748
a(n) = S(n)*S(n-1), where S(n) are the generalized tribonacci numbers A001644.
- Numerators of the fractional coefficients of the square-root of the prime power series: sum_{n=0..inf} p_n x^n, where p_n is the n-th prime and p_0 is defined to be 1.A073749
Numerators of the fractional coefficients of the square-root of the prime power series: sum_{n=0..inf} p_n x^n, where p_n is the n-th prime and p_0 is defined to be 1.
- Factors of 2 in the denominators of the fractional coefficients of the square-root of the prime power series: sum_{n=0..inf} p_n x^n, where p_n is the n-th prime and p_0 is defined to be 1.A073750
Factors of 2 in the denominators of the fractional coefficients of the square-root of the prime power series: sum_{n=0..inf} p_n x^n, where p_n is the n-th prime and p_0 is defined to be 1.
- Prime numbers that when multiplied in order yield the sequence of colossally abundant numbers A004490.A073751
Prime numbers that when multiplied in order yield the sequence of colossally abundant numbers A004490.
- Greatest common divisor of n/spf(n) and n/gpf(n) where spf(n) is the smallest and gpf(n) is the greatest prime factor of n (see A020639, A006530).A073752
Greatest common divisor of n/spf(n) and n/gpf(n) where spf(n) is the smallest and gpf(n) is the greatest prime factor of n (see A020639, A006530).
- a(n) = A073752(A073752(n)), where A073752(n) = gcd(n/spf(n), n/gpf(n)), with spf(n) as the smallest and gpf(n) as the greatest prime factor of n (see A020639, A006530).A073753
a(n) = A073752(A073752(n)), where A073752(n) = gcd(n/spf(n), n/gpf(n)), with spf(n) as the smallest and gpf(n) as the greatest prime factor of n (see A020639, A006530).
- Number of steps needed to reach a prime when the following map is repeatedly applied to n: if n is even then 2n + #(n) + 1, otherwise 2n - #(n) - 1, where #(n) is the number of digits of n; or -1 is no prime is ever reached.A073754
Number of steps needed to reach a prime when the following map is repeatedly applied to n: if n is even then 2n + #(n) + 1, otherwise 2n - #(n) - 1, where #(n) is the number of digits of n; or -1 is no prime is ever reached.
- Number of steps needed to reach a prime when the following map is repeatedly applied to n: if n is even then 2*n + floor(sqrt(n)) + 1, otherwise 2*n - floor(sqrt(n)) - 1; or -1 if no prime is ever reached.A073755
Number of steps needed to reach a prime when the following map is repeatedly applied to n: if n is even then 2*n + floor(sqrt(n)) + 1, otherwise 2*n - floor(sqrt(n)) - 1; or -1 if no prime is ever reached.
- Number of steps needed to reach a prime when the following map is repeatedly applied to n: if n is even then 2n + floor(log(n)) + 1, otherwise 2n - floor(log(n)) - 1; or -1 if no prime is ever reached.A073756
Number of steps needed to reach a prime when the following map is repeatedly applied to n: if n is even then 2n + floor(log(n)) + 1, otherwise 2n - floor(log(n)) - 1; or -1 if no prime is ever reached.
- a(n) = d(n) + phi(n) - 1.A073757
a(n) = d(n) + phi(n) - 1.
- Smallest number that is neither a divisor of nor relatively prime to n, or 0 if no such number exists.A073758
Smallest number that is neither a divisor of nor relatively prime to n, or 0 if no such number exists.
- Largest number < n that is neither a divisor of nor relatively prime to n, or 0 if no such number exists.A073759
Largest number < n that is neither a divisor of nor relatively prime to n, or 0 if no such number exists.
- Integers m such that A073758(m) = 4.A073760
Integers m such that A073758(m) = 4.