Sequences
392,541 sequences
- Members of A000124 which are multiples of 11.A083511
Members of A000124 which are multiples of 11.
- Multiples of 11 with digit sum 11, with no zero digits in odd places.A083512
Multiples of 11 with digit sum 11, with no zero digits in odd places.
- Palindromes in A083512.A083513
Palindromes in A083512.
- Number of steps for iteration of map x -> (4/3)*ceiling(x) to reach an integer > 3n+1 when started at 3n+1, or -1 if no such integer is ever reached.A083514
Number of steps for iteration of map x -> (4/3)*ceiling(x) to reach an integer > 3n+1 when started at 3n+1, or -1 if no such integer is ever reached.
- Smallest number k such that R(n) + k is a square, where R(n) = A002275.A083515
Smallest number k such that R(n) + k is a square, where R(n) = A002275.
- Smallest palindromic multiple of 11, sum of whose digits at some stage is equal to n.A083516
Smallest palindromic multiple of 11, sum of whose digits at some stage is equal to n.
- Triangular numbers which are one more than a product of distinct triangular numbers.A083517
Triangular numbers which are one more than a product of distinct triangular numbers.
- Beginning with 3, a(i)*a(j) + 2 is prime for all i, j, i<>j.A083518
Beginning with 3, a(i)*a(j) + 2 is prime for all i, j, i<>j.
- Beginning with 1, a(i)*a(j) + 2 is prime for all i, j, i != j.A083519
Beginning with 1, a(i)*a(j) + 2 is prime for all i, j, i != j.
- Primes p such that p-1 is a product of two or more consecutive integers. Or (p-1) is a permutation of m items chosen from n, for some m and n. p-1 = k*(k+1)(k+2)...(k+r) for some k and r, r>0.A083520
Primes p such that p-1 is a product of two or more consecutive integers. Or (p-1) is a permutation of m items chosen from n, for some m and n. p-1 = k*(k+1)(k+2)...(k+r) for some k and r, r>0.
- Smallest prime that is the product of n consecutive integers + 1, or 0 if no such number exists.A083521
Smallest prime that is the product of n consecutive integers + 1, or 0 if no such number exists.
- Smallest k such that k*(k+1)*(k+2)*...*(k+n-1) + 1 is prime, or 0 if no such number exists.A083522
Smallest k such that k*(k+1)*(k+2)*...*(k+n-1) + 1 is prime, or 0 if no such number exists.
- Smallest Fibonacci number divisible by 2^n.A083523
Smallest Fibonacci number divisible by 2^n.
- a(1) = 1, a(n) = a(n-1)*n if n is a prime, a(n) = a(n-1)+ n if n is composite.A083524
a(1) = 1, a(n) = a(n-1)*n if n is a prime, a(n) = a(n-1)+ n if n is composite.
- a(1) = 1, a(n) = a(n-1)*n if n is composite, a(n) = a(n-1) + n if n is a prime.A083525
a(1) = 1, a(n) = a(n-1)*n if n is composite, a(n) = a(n-1) + n if n is a prime.
- Composite n such that both n and its reversal in base 10 are squarefree, none of the prime factors of n are palindromes and the prime factors of the reversal of n are the reversals of those of n.A083526
Composite n such that both n and its reversal in base 10 are squarefree, none of the prime factors of n are palindromes and the prime factors of the reversal of n are the reversals of those of n.
- a(n) is the number of times that sums 1+-4+-9+-16+-...+-n^2 of the first n squares is zero. There are 2^(n-1) choices for the sign patterns.A083527
a(n) is the number of times that sums 1+-4+-9+-16+-...+-n^2 of the first n squares is zero. There are 2^(n-1) choices for the sign patterns.
- a(n) = 5^n mod 2*n.A083528
a(n) = 5^n mod 2*n.
- a(n) = 5^n mod 3*n.A083529
a(n) = 5^n mod 3*n.
- a(n) = 7^n mod (2*n).A083530
a(n) = 7^n mod (2*n).
- First difference sequence of A002191. Differences between possible values for sum of divisors of n.A083531
First difference sequence of A002191. Differences between possible values for sum of divisors of n.
- First difference sequence of A007369. Differences between impossible values for sum of divisors of n.A083532
First difference sequence of A007369. Differences between impossible values for sum of divisors of n.
- First difference sequence of A002202. Difference between consecutive possible values of phi(n), the Euler totient function A000010.A083533
First difference sequence of A002202. Difference between consecutive possible values of phi(n), the Euler totient function A000010.
- First difference sequence of A007617. Difference between consecutive values not being in the range of phi (A000010).A083534
First difference sequence of A007617. Difference between consecutive values not being in the range of phi (A000010).
- A version of the Chebyshev function theta(n): a(n) = ceiling(Sum_{primes p <= n } log(p)).A083535
A version of the Chebyshev function theta(n): a(n) = ceiling(Sum_{primes p <= n } log(p)).
- First differences of noncototients A005278.A083536
First differences of noncototients A005278.
- a(0) = a(1) = 0, a(2n) = a(n)+1, a(2n+1) = a(n-1).A083537
a(0) = a(1) = 0, a(2n) = a(n)+1, a(2n+1) = a(n-1).
- a(n) = sigma(n)*sigma(n+1)/gcd(sigma(n+1), sigma(n))^2.A083538
a(n) = sigma(n)*sigma(n+1)/gcd(sigma(n+1), sigma(n))^2.
- a(n) = sigma(n) * sigma(n+1): product of sigma-values for consecutive integers.A083539
a(n) = sigma(n) * sigma(n+1): product of sigma-values for consecutive integers.
- Numbers k such that A083539(k) is a square; solutions x to sigma(x+1)*sigma(x)=y^2 for some y.A083540
Numbers k such that A083539(k) is a square; solutions x to sigma(x+1)*sigma(x)=y^2 for some y.
- Values of y from solutions to sigma(x+1)*sigma(x)=y^2, where A083539(x) = y^2 is a square number.A083541
Values of y from solutions to sigma(x+1)*sigma(x)=y^2, where A083539(x) = y^2 is a square number.
- a(n) = phi(n+1)*phi(n), product of totients of two consecutive integers.A083542
a(n) = phi(n+1)*phi(n), product of totients of two consecutive integers.
- Duplicate of A083538.A083543
Duplicate of A083538.
- a(n) = maximal value of the sum of Mobius function values over a block of n consecutive natural numbers.A083544
a(n) = maximal value of the sum of Mobius function values over a block of n consecutive natural numbers.
- Numbers k such that the geometric mean of the Euler totient function of k and k+1 is an integer.A083545
Numbers k such that the geometric mean of the Euler totient function of k and k+1 is an integer.
- The geometric mean of the Euler totient function of 2 consecutive integers {k, k+1} when it is an integer.A083546
The geometric mean of the Euler totient function of 2 consecutive integers {k, k+1} when it is an integer.
- a(n) = sqrt(sqrt(phi(A083546(n)) * phi(1+A083546(n)))), the 4th root of product of totients of terms and 1+terms of A082788.A083547
a(n) = sqrt(sqrt(phi(A083546(n)) * phi(1+A083546(n)))), the 4th root of product of totients of terms and 1+terms of A082788.
- Least common multiple of cototient values of consecutive integers.A083548
Least common multiple of cototient values of consecutive integers.
- Quotient if least common multiple (lcm) of cototient values of consecutive integers is divided by the greatest common divisor (gcd) of the same pair of consecutive numbers.A083549
Quotient if least common multiple (lcm) of cototient values of consecutive integers is divided by the greatest common divisor (gcd) of the same pair of consecutive numbers.
- Product of 2 consecutive prime differences of two successive terms of A001223.A083550
Product of 2 consecutive prime differences of two successive terms of A001223.
- Least common multiple of 2 consecutive prime differences, of two successive terms of A001223.A083551
Least common multiple of 2 consecutive prime differences, of two successive terms of A001223.
- Quotient when LCM of 2 consecutive prime differences is divided by GCD of the same two differences.A083552
Quotient when LCM of 2 consecutive prime differences is divided by GCD of the same two differences.
- Product of prime(n+1)-1 and prime(n)-1.A083553
Product of prime(n+1)-1 and prime(n)-1.
- Least common multiple of prime(n+1)-1 and prime(n)-1.A083554
Least common multiple of prime(n+1)-1 and prime(n)-1.
- Quotient of LCM of prime(n+1)-1 and prime(n)-1 and GCD of the same two numbers.A083555
Quotient of LCM of prime(n+1)-1 and prime(n)-1 and GCD of the same two numbers.
- n-th Payam number E_{+}(n), defined as the smallest positive odd integer k such that for every positive integer n, the number k*2^n+1 is not divisible by any primes p such that the multiplicative order of 2 mod p is less than or equal to e.A083556
n-th Payam number E_{+}(n), defined as the smallest positive odd integer k such that for every positive integer n, the number k*2^n+1 is not divisible by any primes p such that the multiplicative order of 2 mod p is less than or equal to e.
- a(n) is the greatest prime factor of 3*a(n-1)+2.A083557
a(n) is the greatest prime factor of 3*a(n-1)+2.
- p(p^2-p+1) as p runs through the primes.A083558
p(p^2-p+1) as p runs through the primes.
- Nearest integer to 1/(Sum_{k>=n} 1/k^4).A083559
Nearest integer to 1/(Sum_{k>=n} 1/k^4).
- Nearest integer to 1/sum(k>n,1/k^5).A083560
Nearest integer to 1/sum(k>n,1/k^5).